Showing 2024Show all
2 papers · 1 filter
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.CG2024
Flip Graphs of Pseudo-Triangulations With Face Degree at Most 4
Maarten Löffler, Tamara Mchedlidze, David Orden +2
A pseudo-triangle is a simple polygon with exactly three convex vertices, and all other vertices (if any) are distributed on three concave chains. A pseudo-triangulation~$\mathcal{…