Efficient computation of spatial queries over points stored in \(k^2\)-tree compact data structures (Q2235767): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2021.09.012 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2021.09.012 / rank | |||
Normal rank | |||
Latest revision as of 14:52, 17 December 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
