Spatial Data Structures (1995)
Cached
Download Links
- [esfahaan.usc.edu]
- [www.cs.ust.hk]
- [www.cs.umd.edu]
- [www.umiacs.umd.edu]
- [www.cs.umd.edu]
- [www.cs.umd.edu]
- [www.cs.umd.edu]
- [www.umiacs.umd.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 273 - 13 self |
BibTeX
@INPROCEEDINGS{Samet95spatialdata,
author = {Hanan Samet},
title = {Spatial Data Structures},
booktitle = {},
year = {1995},
publisher = {Addison-Wesley}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
An overview is presented of the use of spatial data structures in spatial databases. The focus is on hierarchical data structures, including a number of variants of quadtrees, which sort the data with respect to the space occupied by it. Suchtechniques are known as spatial indexing methods. Hierarchical data structures are based on the principle of recursive decomposition. They are attractive because they are compact and depending on the nature of the data they save space as well as time and also facilitate operations such as search. Examples are given of the use of these data structures in the representation of different data types such as regions, points, rectangles, lines, and volumes.
