7 citations · 24 across the 10 of their papers we have counts for
22 papers
Capturing the Shape of a Point Set with a Line Segment
Nathan van Beusekom, Marc van Kreveld, Max van Mulken +3
Detecting location-correlated groups in point sets is an important task in a wide variety of applications areas. In addition to merely detecting such groups, the group's shape carr…
Segment Visibility Counting Queries in Polygons
Kevin Buchin, Bram Custers, Ivor van der Hoog +4
Let be a simple polygon with vertices, and let be a set of points or line segments inside . We develop data structures that can efficiently count the number of o…
Snipperclips: Cutting Tools into Desired Polygons using Themselves
Zachary Abel, Hugo Akitaya, Man-Kwun Chiu +7
We study Snipperclips, a computer puzzle game whose objective is to create a target shape with two tools. The tools start as constant-complexity shapes, and each tool can snip (i.e…
Uncertain Curve Simplification
Kevin Buchin, Maarten Löffler, Aleksandr Popov +1
We study the problem of polygonal curve simplification under uncertainty, where instead of a sequence of exact points, each uncertain point is represented by a region, which contai…
Fréchet Distance for Uncertain Curves
Kevin Buchin, Chenglin Fan, Maarten Löffler +3
In this paper we study a wide range of variants for computing the (discrete and continuous) Fréchet distance between uncertain curves. We define an uncertain curve as a sequence of…
Kinetic Geodesic Voronoi Diagrams in a Simple Polygon
Matias Korman, André van Renssen, Marcel Roeloffzen +1
We study the geodesic Voronoi diagram of a set of linearly moving sites inside a static simple polygon with vertices. We identify all events where the structure of…