Box Sort, a multidimensional binary sorting method for rectangular boxes, used for quick range searching
- 202 Downloads
In many geometrical applications data needs to be sorted in more than one dimension to speed up running time. For example, the evaluation of set operations on polygons, and hidden-surface algorithms. We describe an efficient algorithm for doing this, which we call “Box Sort”. Given areN boxes in an-dimensional space. A box is a spatial region bounded by (hyper-)planes orthogonal to the coordinate axes. Box Sort is a multidimensional sorting method for theN boxes, which allows us to perform quick range queries (“box searches”) with respect to these boxes. When the givenN boxes are sufficiently scattered around then-dimensional space, the box search for an arbitrary query box of the same order of size as the sorted boxes can be carried out inO(logN) time. The necessary memory requirement for Box Sort is invariablyO(N).
Key wordsMultidimensional sorting Range searching Set operations on polygons Hidden-surface algorithms
Unable to display preview. Download preview PDF.