3 papers
cs.CG2026
On Reconstructing a Convex Polygon from Partial Information
Alexander Baumann, Therese Biedl, Mahmoud Elashmawi +4
The reconstruction problem asks to construct a (convex) polygon that has a specified set of features, such as an ordered set of edge-lengths or an ordered set of polygon-angles. In…
cs.CG2026
Unbent collections of non-planar -grid-drawing
Therese Biedl
In a recent paper, AntiÄ et al.~studied collections of planar orthogonal drawings of a graph where every edge is unbent in at least one drawing. This paper generalizes this concep…
cs.CG2025
On Computing Vertex Connectivity of 1-Plane Graphs
Therese Biedl, Karthik Murali
The vertex connectivity of a graph is the size of the smallest set of vertices such that is disconnected. For the class of planar graphs, the problem of ver…