2 citations · 3 across the 3 of their papers we have counts for
4 papers · 1 filter
Arrangements of orthogonal circles with many intersections
Sarah Carmesin, André Schulz
An arrangement of circles in which circles intersect only in angles of is called an \emph{arrangement of orthogonal circles}. We show that in the case that no two circles are…
The Partition Spanning Forest Problem
Philipp Kindermann, Boris Klemz, Ignaz Rutter +2
Given a set of colored points in the plane, we ask if there exists a crossing-free straight-line drawing of a spanning forest, such that every tree in the forest contains exactly t…
Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles
Philipp Kindermann, Fabrizio Montecchiani, Lena Schlipf +1
We show that the 1-planar slope number of 3-connected cubic 1-planar graphs is at most 4 when edges are drawn as polygonal curves with at most 1 bend each. This bound is obtained b…
On Numbers of Pseudo-Triangulations
Moria Ben-Ner, André Schulz, Adam Sheffer
We study the maximum numbers of pseudo-triangulations and pointed pseudo-triangulations that can be embedded over a specific set of points in the plane or contained in a specific t…