2 citations · 2 across the 4 of their papers we have counts for
Showing cs.CGShow all
3 papers · 1 filter
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.…
cs.CG2017
Minimum Perimeter-Sum Partitions in the Plane
Mikkel Abrahamsen, Mark de Berg, Kevin Buchin +2
Let be a set of points in the plane. We consider the problem of partitioning into two subsets and such that the sum of the perimeters of an…
cs.CG2013
A (7/2)-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras
Stephane Durocher, Omrit Filtser, Robert Fraser +2
Consider a sliding camera that travels back and forth along an orthogonal line segment inside an orthogonal polygon with vertices. The camera can see a point inside…