On self-approaching and increasing-chord drawings of 3-connected planar graphs
<p>An $st$-path in a drawing of a graph is self-approaching if during the traversal of the corresponding curve from $s$ to any point $t'$ on the curve the distance to $t'$ is non-increasing. A path has increasing chords if it is self-approaching in both directions. A drawing is self-approaching (inc...
Kaydedildi:
| Asıl Yazarlar: | , , |
|---|---|
| Materyal Türü: | Artigo |
| Dil: | Inglês |
| Baskı/Yayın Bilgisi: |
Carleton University
2016-02-01
|
| Seri Bilgileri: | Journal of Computational Geometry |
| Online Erişim: | http://jocg.org/index.php/jocg/article/view/223 |
| Etiketler: |
Etiket eklenmemiş, İlk siz ekleyin!
|