Separability of polyhedra for optimal filtering of spatial and constraint data

This publication has 14 references indexed in Scilit:

• Indexing for data models with constraints and classes (extended abstract)
  Published by Association for Computing Machinery (ACM) ,1993
• The R*-tree: an efficient and robust access method for points and rectangles
  Published by Association for Computing Machinery (ACM) ,1990
• Redundancy in spatial databases
  Published by Association for Computing Machinery (ACM) ,1989
• Set operations on polyhedra using binary space partitioning trees
  ACM SIGGRAPH Computer Graphics, 1987
• A population analysis for hierarchical data structures
  Published by Association for Computing Machinery (ACM) ,1987
• Storing a collection of polygons using quadtrees
  ACM Transactions on Graphics, 1985
• R-trees
  Published by Association for Computing Machinery (ACM) ,1984
• A new approach to rectangle intersections
  International Journal of Computer Mathematics, 1983
• The K-D-B-tree
  Published by Association for Computing Machinery (ACM) ,1981
• Multidimensional binary search trees used for associative searching
  Communications of the ACM, 1975