Upward Point-Set Embeddability
Data Structures and Algorithms
2015-05-20 v1
Abstract
We study the problem of Upward Point-Set Embeddability, that is the problem of deciding whether a given upward planar digraph has an upward planar embedding into a point set . We show that any switch tree admits an upward planar straight-line embedding into any convex point set. For the class of -switch trees, that is a generalization of switch trees (according to this definition a switch tree is a -switch tree), we show that not every -switch tree admits an upward planar straight-line embedding into any convex point set, for any . Finally we show that the problem of Upward Point-Set Embeddability is NP-complete.
Cite
@article{arxiv.1010.5937,
title = {Upward Point-Set Embeddability},
author = {Markus Geyer and Michael Kaufmann and Tamara Mchedlidze and Antonios Symvonis},
journal= {arXiv preprint arXiv:1010.5937},
year = {2015}
}