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...
Uloženo v:
| Hlavní autoři: | , , |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
Carleton University
2016-02-01
|
| Edice: | Journal of Computational Geometry |
| On-line přístup: | http://jocg.org/index.php/jocg/article/view/223 |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|