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

We prove that every n-vertex oriented path admits an upward planar embedding on every general set of (n−1)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. 47; no. 3; pp. 493 - 498
Main Author Mchedlidze, Tamara
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.04.2014
Subjects
Oriented path
Universal point set
Upward point-set embedding
Universal point set
Upward point-set embedding
Oriented path
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 (n−1)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].
ISSN:0925-7721
DOI:10.1016/j.comgeo.2013.11.007