3 papers
cs.CG2026
Holes in Convex and Simple Drawings
Helena Bergold, Joachim Orthaber, Manfred Scheucher +1
Gons and holes in point sets have been extensively studied in the literature. For simple drawings of the complete graph a generalization of the ErdÅs--Szekeres theorem is known an…
cs.CG2026
How many times can two minimum spanning trees cross?
Todor Antić, Todor AntiÄ, Morteza Saghafian +5
Let be a generic set of points in the plane, and let be a coloring of in two colors. We are interested in the number of crossings between the minimum spanni…
cs.CG2025
On Triangular Separation of Bichromatic Point Sets
Helena Bergold, Arun Kumar Das, Robert Lauff +3
We address the problem of computing the minimum number of triangles to separate a set of blue points from a set of red points in . A set of triangles is a \emph{separ…