Faster Compressed Quadtrees
Guillermo de Bernardo, Travis Gagie, Susana Ladra, Gonzalo Navarro and, Diego Seco

TL;DR
This paper introduces a new compact quadtree representation that efficiently handles clustered point sets and supports faster range queries, with practical performance demonstrated through experiments.
Contribution
A novel compact quadtree structure based on heavy path decompositions that improves query speed over previous methods for clustered data.
Findings
Breaks the (1) bits per node bound on clustered point sets
Supports faster range searches than previous compact structures
Experimental results show practical competitiveness
Abstract
Real-world point sets tend to be clustered, so using a machine word for each point is wasteful. In this paper we first show how a compact representation of quadtrees using bits per node can break this bound on clustered point sets, while offering efficient range searches. We then describe a new compact quadtree representation based on heavy path decompositions, which supports queries faster than previous compact structures. We present experimental evidence showing that our structure is competitive in practice.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRobotics and Sensor-Based Localization · Computational Geometry and Mesh Generation · Advanced Image and Video Retrieval Techniques
