activity
20112026
most citedFast Clustering with Lower Bounds: No Customer too Far, No Shop too Small

11 citations · 49 across the 23 of their papers we have counts for

collaborators
Showing 2011Show all

2 papers · 1 filter

cs.CG2011★ 1 cited

On the Expected Complexity of Voronoi Diagrams on Terrains

Anne Driemel, Sariel Har-Peled, Benjamin Raichel

We investigate the combinatorial complexity of geodesic Voronoi diagrams on polyhedral terrains using a probabilistic analysis. Aronov etal [ABT08] prove that, if one makes certain…

cs.CG2011

Geometric Packing under Non-uniform Constraints

Alina Ene, Sariel Har-Peled, Benjamin Raichel

We study the problem of discrete geometric packing. Here, given weighted regions (say in the plane) and points (with capacities), one has to pick a maximum weight subset of the reg…