Efficient computation of spatial queries over points stored in \(k^2\)-tree compact data structures (Q2235767)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient computation of spatial queries over points stored in k^2-tree compact data structures |
scientific article; zbMATH DE number 7412756
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient computation of spatial queries over points stored in \(k^2\)-tree compact data structures |
scientific article; zbMATH DE number 7412756 |
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
0 references
0.7567384839057922
0 references
0.7380468249320984
0 references
0.7137095928192139
0 references
