1 citations · 1 across the 2 of their papers we have counts for
5 papers · 1 filter
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…
Plane Hamiltonian Cycles in Convex Drawings
Helena Bergold, Stefan Felsner, Meghana M. Reddy +2
A conjecture by Rafla from 1988 asserts that every simple drawing of the complete graph admits a plane Hamiltonian cycle. It turned out that already the existence of much sim…
Investigating Simple Drawings of using SAT
Helena Bergold, Manfred Scheucher
We present a SAT framework which allows to investigate properties of simple drawings of the complete graph using the power of AI. In contrast to classic imperative programmin…
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…
Arrangements of Pseudocircles: On Digons and Triangles
Stefan Felsner, Sandro Roch, Manfred Scheucher
In this article, we study the cell-structure of simple arrangements of pairwise intersecting pseudocircles. The focus will be on two problems of Grünbaum (1972). First, we discuss…