Bibliographic Details
| Title: |
Faster compressed quadtrees. |
| Authors: |
de Bernardo, Guillermo1 (AUTHOR), Gagie, Travis1,2 (AUTHOR) travis.gagie@gmail.com, Ladra, Susana1 (AUTHOR), Navarro, Gonzalo3,4 (AUTHOR), Seco, Diego1,3 (AUTHOR) |
| Source: |
Journal of Computer & System Sciences. Feb2023, Vol. 131, p86-104. 19p. |
| Subjects: |
Quadtrees, Point set theory, Multicasting (Computer networks) |
| 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 O (1) 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. [ABSTRACT FROM AUTHOR] |
|
Copyright of Journal of Computer & System Sciences is the property of Academic Press Inc. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
