15 citations · 15 across the 2 of their papers we have counts for
2 papers
cs.CG2021
One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons
Patrizio Angelini, Philipp Kindermann, Andre Löffler +2
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 ca…
cs.CG2019★ 15 cited
Recognizing Stick Graphs with and without Length Constraints
Steven Chaplick, Philipp Kindermann, Andre Löffler +4
Stick graphs are intersection graphs of horizontal and vertical line segments that all touch a line of slope -1 and lie above this line. De Luca et al. [GD'18] considered the recog…