13 citations · 26 across the 20 of their papers we have counts for
4 papers · 1 filter
Dynamic Data Structures for -Nearest Neighbor Queries
Sarita de Berg, Frank Staals
Our aim is to develop dynamic data structures that support -nearest neighbors (-NN) queries for a set of point sites in the plane in time, where is s…
Approximating the Earth Mover's Distance between sets of geometric objects
Marc van Kreveld, Frank Staals, Amir Vaxman +1
Given two distributions and of equal total mass, the Earth Mover's Distance measures the cost of transforming one distribution into the other, where the cost of moving a un…
Terrain prickliness: theoretical grounds for high complexity viewsheds
Ankush Acharyya, Maarten Löffler, Gert G. T. Meijer +3
An important task in terrain analysis is computing \emph{viewsheds}. A viewshed is the union of all the parts of the terrain that are visible from a given viewpoint or set of viewp…
Covering a set of line segments with a few squares
Joachim Gudmundsson, Mees van de Kerkhof, André van Renssen +3
We study three covering problems in the plane. Our original motivation for these problems come from trajectory analysis. The first is to decide whether a given set of line segments…