31 citations · 155 across the 25 of their papers we have counts for
7 papers · 1 filter
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…
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…
Temporal Map Labeling: A New Unified Framework with Experiments
Lukas Barth, Benjamin Niedermann, Martin Nöllenburg +1
The increased availability of interactive maps on the Internet and on personal mobile devices has created new challenges in computational cartography and, in particular, for label…
Dynamic Planar Point Location with Sub-Logarithmic Local Updates
Maarten Löffler, Joe Simons, Darren Strash
We study planar point location in a collection of disjoint fat regions, and investigate the complexity of \emph {local updates}: replacing any region by a different region that is…
Priority Range Trees
Michael T. Goodrich, Darren Strash
We describe a data structure, called a priority range tree, which accommodates fast orthogonal range reporting queries on prioritized points. Let be a set of points in the…
Succinct Greedy Geometric Routing in the Euclidean Plane
Michael T. Goodrich, Darren Strash
In greedy geometric routing, messages are passed in a network embedded in a metric space according to the greedy strategy of always forwarding messages to nodes that are closer to…