| 
|
Quote: skip quadtrees and octrees for multi-dimensional data; efficient insert, delete, location, approximate range, approximate nearest neighbor; logarithmic-height search and update
Topic:
search algorithms
Topic:
computational geometry
Quotation Skeleton
We present a new multi-dimensional data structure, which … data in R^d, with constant d>2). Our data … "box"-shaped regions of region quadtrees and the logarithmic-height … exactly a region quadtree (or octree for higher … well as fast methods for performing point location, … [p. 297] We describe both randomized and deterministic versions … Our skip quadtree data structure … is, to our knowledge, the first balanced aspect … Google-1 Google-2
Copyright clearance needed for quotation.
Topic: search algorithms (40 items)
Topic: computational geometry (20 items)