2 citations · 2 across the 1 of their papers we have counts for
3 papers
cs.CG2019
On One-Round Discrete Voronoi Games
Mark de Berg, Sándor Kisfaludi-Bak, Mehran Mehr
Let be a multiset of points in , which we call voters, and let and be two given constants. We consider the following game, where two pl…
cs.CG2018
Fast Fencing
Mikkel Abrahamsen, Anna Adamaszek, Karl Bringmann +5
We consider very natural "fence enclosure" problems studied by Capoyleas, Rote, and Woeginger and Arkin, Khuller, and Mitchell in the early 90s. Given a set of points in th…
cs.CG2017★ 2 cited
Range-Clustering Queries
Mikkel Abrahamsen, Mark de Berg, Kevin Buchin +2
In a geometric -clustering problem the goal is to partition a set of points in into subsets such that a certain cost function of the clustering is minimized.…