The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs

Ina Goeßmann, Jonathan Klawitter, Boris Klemz +5

The segment number of a planar graph $G$ is the smallest number of line segments needed for a planar straight-line drawing of $G$. Dujmović, Eppstein, Suderman, and Wood [CGTA'07]…