Box-trees and R-trees with near-optimal query time
type: Item
instance of: scholarly article
title: Box-trees and R-trees with near-optimal query time
zbMATH Open document ID: 1016.68058
published in: Discrete \& Computational Geometry
publication date: 2002-12-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1837069
zbMATH Keywords: box-tree
author: Pankaj K. Agarwal
author: Mark de Berg
author: Joachim Gudmundsson
author: Mikael Hammar
author: Herman Haverkort
MaRDI profile type: Publication
full work available at URL: s00454-002-2817-1
OpenAlex ID: W2134438395
DOI: 10.1007/S00454-002-2817-1
Recommended article: Box-trees and R-trees with near-optimal query time
Recommended article: On R-trees with low query complexity
Recommended article: Reflections on Optimal and Nearly Optimal Binary Search Trees
Recommended article: Efficient Construction of Near-Optimal Binary and Multiway Search Trees
Recommended article: Efficient bulk operations on dynamic \(R\)-trees
Recommended article: On Cartesian trees and range minimum queries
Recommended article: On Cartesian Trees and Range Minimum Queries
Recommended article: Succinct Representations of Binary Trees for Range Minimum Queries
Recommended article: Cache-oblivious R-trees
description: scientific article; zbMATH DE number 1837069