Geometric partitioning made easier, even in parallel
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
| Hi-index | 0.00 |
\indent In this survey paper we review some results related to {\em geometric partitioning}, i.e. given a set of objects in $ {\bf R}^{d}$, partition the space into few regions so that each region intersects a small number of objects. We first describe the known bounds on the size of such a partitioning and present some of the algorithms for computing a geometric partitioning. We then discuss several applications of geometric partitioning.