13 citations · 26 across the 20 of their papers we have counts for
4 papers · 1 filter
Visibility Queries in Simple Polygons
Sujoy Bhore, Chih-Hung Liu, Anurag Murty Naredla +6
Given a simple polygon with vertices, we consider the problem of constructing a data structure for visibility queries: for any query point , compute the visibility…
Smallest Enclosing Disk Queries Using Farthest-Point Voronoi Diagrams
Kevin Buchin, Mark Joachim Krallmann, Frank Staals
Let be a set of points in . Our goal is to preprocess to efficiently compute the smallest enclosing disk of the points in that lie inside an axis-alig…
Approximate Dynamic Nearest Neighbor Searching in a Polygonal Domain
Joost van der Laan, Frank Staals, Lorenzo Theunissen
We present efficient data structures for approximate nearest neighbor searching and approximate 2-point shortest path queries in a two-dimensional polygonal domain with ver…
On strictly output sensitive color frequency reporting
Erwin Glazenburg, Frank Staals
Given a set of colored points we wish to store such that, given some query region , we can efficiently report the colors of the points appearing…