One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:KUHHZW7Wrecord.jsonopen to challenge →
classification
cs.CG
keywords
drawingouterplanarsimplealreadybendcasecomputeconsider
read the original abstract
We consider the problem of drawing an outerplanar graph with $n$ vertices with at most one bend per edge if the outer face is already drawn as a simple polygon. We prove that it can be decided in $O(nm)$ time if such a drawing exists, where $m\le n-3$ is the number of interior edges. In the positive case, we can also compute such a drawing.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.