37 citations · 192 across the 51 of their papers we have counts for
Showing 2011Show all
3 papers · 1 filter
cs.CG2011
Minimum Convex Partitions and Maximum Empty Polytopes
Adrian Dumitrescu, Sariel Har-Peled, Csaba D. Tóth
Let be a set of points in . A Steiner convex partition is a tiling of with empty convex bodies. For every integer , we show that admits…
math.CO2011
Packing anchored rectangles
Adrian Dumitrescu, Csaba D. Tóth
Let be a set of points in the unit square , one of which is the origin. We construct pairwise interior-disjoint axis-aligned empty rectangles such that the low…
cs.CG2011
Collinearities in Kinetic Point Sets
Ben D. Lund, George B. Purdy, Justin W. Smith +1
Let be a set of points in the plane, each point moving along a given trajectory. A {\em -collinearity} is a pair of a line and a time such that conta…