Showing cs.CGShow all
2 papers · 1 filter
cs.CG2012
A Lower Bound for Shallow Partitions
Wolfgang Mulzer, Daniel Werner
Let P be a planar n-point set. A k-partition of P is a subdivision of P into n/k parts of roughly equal size and a sequence of triangles such that each part is contained in a trian…
cs.CG2010
Polynomial Bounds on the Slicing Number
Daniel Werner, Matthias Lenz
NOTE: Unfortunately, most of the results mentioned here were already known under the name of "d-separated interval piercing". The result that T_d(m) exists was first proved by Gyaŕ…