On R-trees with low query complexity
type: Item
instance of: scholarly article
title: On R-trees with low query complexity
zbMATH Open document ID: 1012.68208
DOI: 10.1016/S0925-7721(02)00112-8
author: Mark H. Overmars
author: Mark de Berg
author: Joachim Gudmundsson
author: Mikael Hammar
published in: Computational Geometry
publication date: 2003-04-28T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 1902838
zbMATH Keywords: computational geometry
zbMATH Keywords: data structure
zbMATH Keywords: R-tree
zbMATH Keywords: bounding-volume hiearchy
zbMATH Keywords: spatial access method
MaRDI profile type: Publication
cites work: Q4796163
cites work: Enclosing many boxes by an optimal pair of boxes
cites work: Q4239932
cites work: Q3219751
cites work: Analysis of a bounding box heuristic for object intersection
description: scientific article; zbMATH DE number 1902838