Analyzing range queries on spatial data
- 7 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- I/O complexity for range queries on region data stored using an R-treePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1999
- An Advancing Front Delaunay Triangulation Algorithm Designed for RobustnessJournal of Computational Physics, 1995
- Beyond uniformity and independencePublished by Association for Computing Machinery (ACM) ,1994
- On packing R-treesPublished by Association for Computing Machinery (ACM) ,1993
- The R*-tree: an efficient and robust access method for points and rectanglesACM SIGMOD Record, 1990
- Linear clustering of objects with multiple attributesPublished by Association for Computing Machinery (ACM) ,1990
- Equi-depth multidimensional histogramsPublished by Association for Computing Machinery (ACM) ,1988
- Analysis of object oriented spatial access methodsPublished by Association for Computing Machinery (ACM) ,1987
- An algorithm for displaying a class of space‐filling curvesSoftware: Practice and Experience, 1986
- Quad trees a data structure for retrieval on composite keysActa Informatica, 1974