1 citations · 1 across the 4 of their papers we have counts for
Showing cs.CGShow all
2 papers · 1 filter
cs.CG2026★ 1 cited
Bicriteria Polygon Aggregation with Arbitrary Shapes
Lotte Blank, David Eppstein, Jan-Henrik Haunert +6
We study the problem of aggregating a set of polygons by covering them with disjoint representative regions, thereby inducing a clustering of the polygons. Equivalently, this can b…
cs.CG2026
Graph-Based Nearest-Neighbor Search without the Spread
Jeff Giliberti, Sariel Har-Peled, Jonas Sauer +1
Recent work showed how to construct nearest-neighbor graphs of linear size, on a given set of points in , such that one can answer ap…