6 papers · 1 filter
Bowties and Hourglasses: Intersections of Double-Wedges (or Stabbing and Avoiding Line Segments)
Daniel Bertschinger, Henry Förster, Fabian Klute +3
We study the common intersection of arrangements of double-wedges. We consider arrangements where double-wedges may be either bowties (which do not contain a vertical line) or hour…
Algorithms for Distance Problems in Continuous Graphs
Sergio Cabello, Delia Garijo, Antonia Kalb +3
We study the problem of computing the diameter and the mean distance of a continuous graph, i.e., a connected graph where all points along the edges, instead of only the vertices,…
Computing crossing numbers with topological and geometric restrictions
Thekla Hamm, Fabian Klute, Irene Parada
Computing the crossing number of a graph is one of the most classical problems in computational geometry. Both it and numerous variations of the problem have been studied, and over…
Barking dogs: A Fréchet distance variant for detour detection
Ivor van der Hoog, Fabian Klute, Irene Parada +1
Imagine you are a dog behind a fence and a hiker is passing by at constant speed along the hiking path . In order to fulfil your duties as a watchdog, you desire to bark as…
On -Plane Insertion into Plane Drawings
Julia Katheder, Philipp Kindermann, Fabian Klute +2
We introduce the -Plane Insertion into Plane drawing (-PIP) problem: given a plane drawing of a planar graph and a set of edges, insert the edges in into the draw…
Geometric Thickness of Multigraphs is -complete
Henry Förster, Philipp Kindermann, Tillmann Miltzow +3
We say that a (multi)graph has geometric thickness if there exists a straight-line drawing and a -coloring of its edges where no…