Abstract
In this paper, we study the problem of drawing a given planar graph such that vertices are at pre-specified points and the entire drawing is inside a given polygon. We give a method that shows that for an n-vertex graph and a k-sided polygon, Θ(kn 2) bends are always sufficient. We also give an example of a graph where Θ(kn 2) bends are necessary for such a drawing. © 2012 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Biedl, T., & Floderus, P. (2012). Drawing planar graphs on points inside a polygon. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7464 LNCS, pp. 172–183). https://doi.org/10.1007/978-3-642-32589-2_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
