Query processing of spatial objects: Complexity versus redundancy

This publication has 11 references indexed in Scilit:

• Comparison of approximations of complex objects used for approximation-based query processing in spatial database systems
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• An Efficient Map Overlay Algorithm Based on Spatial Access Methods and Computational Geometry
  Published by Springer Nature ,1992
• The performance of object decomposition techniques for spatial query processing
  Published by Springer Nature ,1991
• Properties of geographic data: Requirements for spatial access methods
  Published by Springer Nature ,1991
• 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
• Minimum Decompositions of Polygonal Objects
  Published by Elsevier ,1985
• Optimal Convex Decompositions
  Published by Elsevier ,1985
• The Grid File
  ACM Transactions on Database Systems, 1984
• Minimum partition of polygonal regions into trapezoids
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1983