A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Canonical Ordering for Triangulations on the Cylinder, with Applications to Periodic Straight-Line Drawings
[chapter]
2013
Lecture Notes in Computer Science
We extend the notion of canonical orderings to cylindric triangulations. This allows us to extend the incremental straight-line drawing algorithm of de Fraysseix, Pach and Pollack to this setting. Our algorithm yields in linear time a crossing-free straight-line drawing of a cylindric triangulation G with n vertices on a regular grid Z/wZ × [0. .h], with w ≤ 2n and h ≤ n(2d + 1), where d is the (graph-) distance between the two boundaries. As a by-product, we can also obtain in linear time a
doi:10.1007/978-3-642-36763-2_34
fatcat:fcfkoab7anbsthjfpnwvp3v7bq