Efficient computation of spatial queries over points stored in k^2-tree compact data structures

DOI10.1016/J.TCS.2021.09.012MaRDI QIDQ2235767zbMATH OpenOpenAlexFDO

Authors Fernando Santolaya, Mónica Caniupán, Luis Gajardo, Miguel Romero, Rodrigo Torres-Avilés

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

zbMATH Keywords

algorithmscomputational geometryspatial databasesspatial queriescompact data structures

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Faster compressed quadtrees
• A new plane-sweep algorithm for the \(K\)-closest-pairs query
• scientific article; zbMATH DE number 1953148
• scientific article; zbMATH DE number 5670169
• Fast neighbor search by using revised k-d tree

Cites work

• An Algorithm for Finding Nearest Neighbors
• An optimal algorithm for approximate nearest neighbor searching fixed dimensions
• Fully functional static and dynamic succinct trees
• GraCT: a grammar-based compressed index for trajectory data
• Multidimensional binary search trees used for associative searching
• Quad trees: A data structure for retrieval by composite keys
• Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences
• Succinct Trees in Practice

Cited in

(3)

• scientific article; zbMATH DE number 917638 (Why is no real title available?)
• A Probabilistic Analysis of Trie-Based Sorting of Large Collections of Line Segments in Spatial Databases
• A new plane-sweep algorithm for the \(K\)-closest-pairs query

This page was built for publication: Efficient computation of spatial queries over points stored in \(k^2\)-tree compact data structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2235767)