Efficient computation of spatial queries over points stored in \(k^2\)-tree compact data structures
From MaRDI portal
Publication:2235767
DOI10.1016/j.tcs.2021.09.012OpenAlexW3199990467MaRDI QIDQ2235767
Fernando Santolaya, Rodrigo Torres-Avilés, Miguel Romero, Luis Gajardo, Mónica Caniupán
Publication date: 21 October 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2021.09.012
Cites Work
- Quad trees: A data structure for retrieval by composite keys
- GraCT: a grammar-based compressed index for trajectory data
- Fully Functional Static and Dynamic Succinct Trees
- An optimal algorithm for approximate nearest neighbor searching fixed dimensions
- Multidimensional binary search trees used for associative searching
- An Algorithm for Finding Nearest Neighbors
- Spaces, Trees, and Colors
- Succinct Trees in Practice
This page was built for publication: Efficient computation of spatial queries over points stored in \(k^2\)-tree compact data structures
