Upward planar embedding of an n-vertex oriented path on O(n2)O(n2) points

We prove that every n-vertex oriented path admits an upward planar embedding on every general set of (na1)2+1(na1)2+1 points on the plane. This result improves the previously known upper bound which is exponential in the number of switches of the given oriented path (Angelini et al. 2010) [1].

Saved in:
Bibliographic Details
Published inComputational geometry : theory and applications Vol. 46; no. 8; pp. 1003 - 1008
Main Author Mchedlidze, Tamara
Format Journal Article
LanguageEnglish
Published 01.10.2013
Subjects
Computational geometry
Planes
Switches
Upper bounds
Online AccessGet full text

Cover

More Information
Summary:We prove that every n-vertex oriented path admits an upward planar embedding on every general set of (na1)2+1(na1)2+1 points on the plane. This result improves the previously known upper bound which is exponential in the number of switches of the given oriented path (Angelini et al. 2010) [1].
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
content type line 23
ObjectType-Feature-1
ISSN:0925-7721
DOI:10.1016/j.comgeo.2013.05.004