Efficient computation of spatial queries over points stored in \(k^2\)-tree compact data structures (Q2235767): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Succinct Trees in Practice / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Spaces, Trees, and Colors / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fully Functional Static and Dynamic Succinct Trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: GraCT: a grammar-based compressed index for trajectory data / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Multidimensional binary search trees used for associative searching / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Quad trees: A data structure for retrieval by composite keys / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Algorithm for Finding Nearest Neighbors / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An optimal algorithm for approximate nearest neighbor searching fixed dimensions / rank | |||
Normal rank | |||
Revision as of 20:53, 26 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient computation of spatial queries over points stored in \(k^2\)-tree compact data structures |
scientific article |
Statements
Efficient computation of spatial queries over points stored in \(k^2\)-tree compact data structures (English)
0 references
21 October 2021
0 references
algorithms
0 references
compact data structures
0 references
spatial databases
0 references
computational geometry
0 references
spatial queries
0 references
