Buscar
Mostrando ítems 1-4 de 4
Aggregated 2D range queries on clustered points
(Elsevier Ltd, 2016-09)
[Abstract] Efficient processing of aggregated range queries on two-dimensional grids is a common requirement in information retrieval and data mining systems, for example in Geographic Information Systems and OLAP cubes. ...
Navigating planar topologies in near-optimal space and time
(Elsevier B.V., 2023-02)
[Abstract]: We show that any embedding of a planar graph can be encoded succinctly while efficiently answering a number of topological queries near-optimally. More precisely, we build on a succinct representation that ...
Compact representations of spatial hierarchical structures with support for topological queries
(Elsevier Inc., 2023-06)
[Abstract]: Among different spatial data models, the topological model for spatial regions explicitly represents common boundaries. This model pursues the efficiency of topology-related queries and the elimination of data ...
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 ...