2 citations · 2 across the 3 of their papers we have counts for
8 papers
Efficient Fréchet distance queries for segments
Maike Buchin, Ivor van der Hoog, Tim Ophelders +3
We study the problem of constructing a data structure that can store a two-dimensional polygonal curve , such that for any query segment one can efficiently comp…
One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons
Patrizio Angelini, Philipp Kindermann, Andre Löffler +2
We consider the problem of drawing an outerplanar graph with vertices with at most one bend per edge if the outer face is already drawn as a simple polygon. We prove that it ca…
Augmenting Geometric Graphs with Matchings
Alexander Pilz, Jonathan Rollin, Lena Schlipf +1
We study noncrossing geometric graphs and their disjoint compatible geometric matchings. Given a cycle (a polygon) P we want to draw a set of pairwise disjoint straight-line edges…
On Romeo and Juliet Problems: Minimizing Distance-to-Sight
Hee-Kap Ahn, Eunjin Oh, Lena Schlipf +2
We introduce a variant of the watchman route problem, which we call the quickest pair-visibility problem. Given two persons standing at points and in a simple polygon w…
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…
Convexity-Increasing Morphs of Planar Graphs
Linda Kleist, Boris Klemz, Anna Lubiw +3
We study the problem of convexifying drawings of planar graphs. Given any planar straight-line drawing of an internally 3-connected graph, we show how to morph the drawing to one w…