Box-trees and R-trees with near-optimal query time

P.K. Agarwal, M.T. de Berg, J. G. Gudmundsson, M. Hammar, H.J. Haverkort

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

Original language	Undefined/Unknown
Title of host publication	Proc. 17th ACM Symposium on Computational Geometry
Place of Publication	New York
Publisher	Association for Computing Machinery
Pages	124-133
Number of pages	10
Publication status	Published - 2001

17th ACM Symposium on Computational Geometry

Keywords

@inproceedings{33b6381529734765ac6860d031caa519,

title = "Box-trees and R-trees with near-optimal query time",

keywords = "Wiskunde en Informatica (WIIN)",

author = "P.K. Agarwal and {de Berg}, M.T. and Gudmundsson, {J. G.} and M. Hammar and H.J. Haverkort",

note = "17th ACM Symposium on Computational Geometry",

year = "2001",

language = "Undefined/Unknown",

pages = "124--133",

booktitle = "Proc. 17th ACM Symposium on Computational Geometry",

publisher = "Association for Computing Machinery",

address = "United States",

}

TY - GEN

T1 - Box-trees and R-trees with near-optimal query time

AU - Agarwal, P.K.

AU - de Berg, M.T.

AU - Gudmundsson, J. G.

AU - Hammar, M.

AU - Haverkort, H.J.

N1 - 17th ACM Symposium on Computational Geometry

PY - 2001

Y1 - 2001

KW - Wiskunde en Informatica (WIIN)

M3 - Conference contribution

SP - 124

EP - 133

BT - Proc. 17th ACM Symposium on Computational Geometry

PB - Association for Computing Machinery

CY - New York

ER -