cell tree

(data structure)

Definition: A spatial access method where successive levels are split by arbitrary hyperplanes. Concave objects are decomposed into convex pieces. Each convex piece is indexed in every cell which it overlaps.

See also BSP-tree, R⁺-tree.

Note: After [GG98].

Author: PEB

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.

Entry modified Fri Dec 17 11:49:12 2004.
HTML page formatted Wed Oct 26 09:47:19 2005.

Cite this as:
Paul E. Black, "cell tree", from Dictionary of Algorithms and Data Structures, Paul E. Black, ed., NIST.
http://www.nist.gov/dads/HTML/celltree.html