2 papers
cs.CG2024
Disjoint Compatibility via Graph Classes
Oswin Aichholzer, Julia Obmann, Pavel Paták +3
Two plane drawings of graphs on the same set of points are called disjoint compatible if their union is plane and they do not have an edge in common. Let be a convex point set…
cs.CG2022
Nearest-Neighbor Decompositions of Drawings
Jonas Cleve, Nicolas Grelier, Kristin Knorr +3
Let be a set of straight-line segments in the plane, potentially crossing, and let be a positive integer. We denote by the union of the endpoints of the strai…