13 citations · 26 across the 20 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
cs.CG2022★ 1 cited
Chromatic -Nearest Neighbor Queries
Thijs van der Horst, Maarten Löffler, Frank Staals
Let be a set of colored points. We develop efficient data structures that store and can answer chromatic -nearest neighbor (-NN) queries. Such a query consists of…
cs.CG2022
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…
cs.CG2022
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…