One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons
Patrizio Angelini, Philipp Kindermann, Andre L\"offler, Lena, Schlipf, Antonios Symvonis

TL;DR
This paper investigates the problem of drawing outerplanar graphs inside simple polygons with at most one bend per edge, providing an algorithm to decide existence and construct such drawings efficiently.
Contribution
It introduces an $O(nm)$ time algorithm to determine the existence of and construct one-bend drawings of outerplanar graphs inside simple polygons.
Findings
Decidable in $O(nm)$ time whether such a drawing exists.
Provides a method to compute the drawing when it exists.
Applicable to graphs with up to $n-3$ interior edges.
Abstract
We consider the problem of drawing an outerplanar graph with 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 time if such a drawing exists, where is the number of interior edges. In the positive case, we can also compute such a drawing.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · 3D Modeling in Geospatial Applications · Optimization and Packing Problems
