Box Sort, a multidimensional binary sorting method for rectangular boxes, used for quick range searching

  title={Box Sort, a multidimensional binary sorting method for rectangular boxes, used for quick range searching},
  author={Piet Houthuys},
  journal={The Visual Computer},
  • Piet Houthuys
  • Published 1 December 1987
  • Computer Science
  • The Visual Computer
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… 
Geometric Range Searching and Its Relatives
This volume provides an excellent opportunity to recapitulate the current status of geometric range searching and to summarize the recent progress in this area.
Reasoning about visibility
The Nearest Polytope Problem: Algorithms and Application to Controlling Hybrid Systems
The AH-polytope representation is considered, which generalizes the H-polyTope representation and is particularly useful in the context of control, through preprocessing the polytopes into efficient data structures, to avoid exhaustive search at query time.
Foundations of brick diagrams
The foundations of 2-dimensional graphical languages, with a view towards their computer implementation in a 'compiler' for monoidal categories, are discussed, and a minor variant of cubical pasting diagrams is introduced, which is used in the Statebox visual programming language.
Mixed Spatial and Nonspatial Problems in Location Based Services
iSafe, a privacy preserving algorithm for computing safety snapshots of co-located mobile devices as well as geosocial network users is proposed and iSafe utilizes parallel computing with MapReduce to handle scalability issues in large geospatial databases.
An Efficient Computational Framework for Studying Dynamical Systems
  • Islam ElShaarawy, W. Gomaa
  • Mathematics, Computer Science
    2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
  • 2013
A new algorithmic strategy is introduced that overcomes the dependence on initial conditions, supports deriving ubiquitous conclusions, enables finding bifurcation points up to certain precision, and is computationally efficient.


Geographical Data Structures Compared: A Study of Data Structures Supporting Region Queries
  • J. Rosenberg
  • Computer Science
    IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • 1985
The conclusion of this paper is that in applications where region search (or point search) on large problems is crucial (as in computer-aided design), k-d trees provide superior performance.
Multidimensional binary search trees used for associative searching
The multidimensional binary search tree (or <italic>k-d tree) as a data structure for storage of information to be retrieved by associative searches is developed and it is shown to be quite efficient in its storage requirements.
Data Structures for Range Searching
The purpose of this paper is to acquaint the reader with the structures currently avadable for solving the particular problem of range searching, and to display a set of general methods for attacking multikey searching problems.
The Quadtree and Related Hierarchical Data Structures
L'accentuation est mise sur la representation de donnees dans les applications de traitement d'images, d'infographie, les systemes d'informations geographiques and the robotique.
A Characterization of Ten Hidden-Surface Algorithms
The paper shows that the order of sorting and the types of sorting used form differences among the existing hidden-surface algorithms.