Minimum convex partitions and maximum empty polytopes
<p>Let <em>S</em> be a set of <em>n</em> points in <strong>R</strong><sup>d</sup>. A Steiner convex partition is a tiling of conv(<em>S</em>) with empty convex bodies. For every integer <em>d</em>, we show that <em>S...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Carleton University
2014-05-01
|
| Series: | Journal of Computational Geometry |
| Online Access: | http://jocg.org/index.php/jocg/article/view/112 |