We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
International audienceWe extend the notion of canonical ordering, initially developed for planar tri-angulations and 3-connected planar maps, to cylindric triangulations and more generally to cylindric 3-connected maps. This allows us to extend the incremental straight-line drawing algorithm of de Fraysseix, Pach and Pollack and of Kant from the planar triangulated case and the 3-connected case to this setting. Precisely, for any cylindric essentially 3-connected map G with n vertices, we can obtain in linear time a straight-line drawing of G that is periodic in x-direction, crossing-free, and internally (weakly) convex. The vertices of this drawing lie on a regular grid Z/wZ × [0..h], with w ≤ 2n and h ≤ n(2d + 1), where d is the face-distance between the two boundaries. This also yields an efficient periodic drawing algorithm for graphs on the torus. Precisely, for any essentially 3-connected map G on the torus (i.e., 3-connected in the periodic representation) with n vertices, we can compute in linear time a periodic straight-line drawing of G that is crossing-free and (weakly) convex, on a periodic regular grid Z/wZ × Z/hZ, with w ≤ 2n and h ≤ 1 + 2n(c + 1), where c is the face-width of G. Since c ≤ √ 2n, the grid area is O(n 5/2)
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.