(definition)
Definition: A data structure to search for lines, polygons, etc.
Also known as SAM.
Specialization (... is a kind of me.)
cell tree, extended k-d tree, GBD-tree, multilayer grid file, D-tree, P-tree, R-file, R+-tree, R*-tree, R-tree, skd-tree.
See also point access method, space ordering method.
Note: After [GG98]. Point access methods may not support region, overlap, enclosure, etc. searches very well.
Author: PEB
Demonstrations of some spatial access methods.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 19 June 2006.
HTML page formatted Mon Sep 11 09:46:07 2006.
Cite this as:
Paul E. Black, "spatial access method", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 19 June 2006. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/spatialAccessMethod.html
