Analyzing range queries on spatial data
Authors:
- J. JinJJJ. Jin
- N. AnNAN. An
- A. SivasubramaniamASA. Sivasubramaniam
- 7 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 525-534
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- I/O complexity for range queries on region data stored using an R-tree1999
- An Advancing Front Delaunay Triangulation Algorithm Designed for RobustnessJournal of Computational Physics, 1995
- Beyond uniformity and independence1994
- On packing R-trees1993
- The R*-tree: an efficient and robust access method for points and rectanglesACM SIGMOD Record, 1990
- Linear clustering of objects with multiple attributes1990
- Equi-depth multidimensional histograms1988
- Analysis of object oriented spatial access methods1987
- 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