The skip quadtree
From MaRDI portal
Publication:5370625
DOI10.1145/1064092.1064138zbMath1380.68142OpenAlexW2169751639MaRDI QIDQ5370625
David Eppstein, Jonathan Z. Sun, Michael T. Goodrich
Publication date: 20 October 2017
Published in: Proceedings of the twenty-first annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1064092.1064138
quadtreeapproximation algorithmrangenearest neighborpoint locationoctreedynamic data structureskip quadtree
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05) Approximation algorithms (68W25)
Related Items (5)
Noisy colored point set matching ⋮ Transition scale-spaces: A computational theory for the discretized entorhinal cortex ⋮ Window queries for intersecting objects, maximal points and approximations using coresets ⋮ Reporting flock patterns ⋮ Fully dynamic geometric spanners
This page was built for publication: The skip quadtree
