Recommendations
- SKIP QUADTREES: DYNAMIC DATA STRUCTURES FOR MULTIDIMENSIONAL POINT SETS
- Algorithms and Computation
- Fringed-quadtrees: a new kind of data structure
- scientific article; zbMATH DE number 3889305
- Quad-k d trees: a general framework for k d trees and quad trees
- The space efficiency of quadtrees
- Skip-webs, efficient distributed data structures for multi-dimensional data sets
- A Quadtree-Based Dynamic Attribute Indexing Method
Cited in
(13)- Skip-webs, efficient distributed data structures for multi-dimensional data sets
- Algorithms and Computation
- Efficient regular data structures and algorithms for dilation, location, and proximity problems
- Reporting flock patterns
- Window queries for intersecting objects, maximal points and approximations using coresets
- scientific article; zbMATH DE number 1875355 (Why is no real title available?)
- A dynamic data structure for approximate range searching
- Fully dynamic geometric spanners
- A deterministic skip list for \(k\)-dimensional range search
- SKIP QUADTREES: DYNAMIC DATA STRUCTURES FOR MULTIDIMENSIONAL POINT SETS
- Noisy colored point set matching
- Transition scale-spaces: a computational theory for the discretized entorhinal cortex
- A self-adjusting data structure for multidimensional point sets
This page was built for publication: The skip quadtree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5370625)