M. Mehr

activity

20172019

most citedRange-Clustering Queries

2 citations · 2 across the 3 of their papers we have counts for

collaborators

4 papers

cs.CG2019

On One-Round Discrete Voronoi Games

Mark de Berg, Sándor Kisfaludi-Bak, Mehran Mehr

Let $V$ be a multiset of $n$ points in $R^{d}$ , which we call voters, and let $k \geq 1$ and $ℓ \geq 1$ 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 $S$ of $n$ points in th…

cs.CG2017★ 2 cited

Range-Clustering Queries

Mikkel Abrahamsen, Mark de Berg, Kevin Buchin +2

In a geometric $k$ -clustering problem the goal is to partition a set of points in $R^{d}$ into $k$ 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 $P$ be a set of $n$ points in the plane. We consider the problem of partitioning $P$ into two subsets $P_{1}$ and $P_{2}$ such that the sum of the perimeters of $CH (P_{1})$ an…