On R-trees with low query complexity (Q1869749): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4796163 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Enclosing many boxes by an optimal pair of boxes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4239932 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3219751 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Analysis of a bounding box heuristic for object intersection / rank | |||
Normal rank |
Latest revision as of 14:35, 5 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On R-trees with low query complexity |
scientific article |
Statements
On R-trees with low query complexity (English)
0 references
28 April 2003
0 references
computational geometry
0 references
data structure
0 references
R-tree
0 references
bounding-volume hiearchy
0 references
spatial access method
0 references