Abstract
Lombardi drawings are drawings of graphs in the plane so that every edge is represented by a circular arc and every vertex has perfect angular resolution. We study planar Lombardi drawings for outerpaths, i.e., outerplanar graphs whose dual is a path. We show that every outerpath has an outerplanar Lombardi drawing and present a linear-time algorithm to construct it.
Original language | English |
---|---|
Title of host publication | Proc. 20th Symposium on Graph Drawing |
Publisher | Springer |
Pages | 561-562 |
Number of pages | 2 |
ISBN (Electronic) | 978-3-642-36763-2 |
ISBN (Print) | 978-3-642-36762-5 |
DOIs | |
Publication status | Published - 2012 |
Bibliographical note
ln-pldo-12 (to appear)EARLI SIG 5 Conference, Utrecht University, the Netherlands
Keywords
- CG, GRAPH, GD