2 citations · 2 across the 4 of their papers we have counts for
5 papers
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.…
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…
Finding Pairwise Intersections Inside a Query Range
Mark de Berg, Joachim Gudmundsson, Ali D. Mehrabi
We study the following problem: preprocess a set O of objects into a data structure that allows us to efficiently report all pairs of objects from O that intersect inside an axis-a…
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…
On Unique Independence Weighted Graphs
Farzad Didehvar, Ali D. Mehrabi, Fatemeh Raee B
An independent set in a graph G is a set of vertices no two of which are joined by an edge. A vertex-weighted graph associates a weight with every vertex in the graph. A vertex-wei…