ListarGI-LBD - Artigos por tema "Range queries"
Mostrando ítems 1-1 de 1
-
Faster compressed quadtrees
(Elsevier B.V., 2023-02)[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 ...