@article{4109,
  abstract     = {Rectangle location search in d dimensions is finding the d-dimensional axis-parallel box of a non-overlapping collection C that contains a query point. A new data structure is proposed that requires optimal space and 0(logd|C|) time for a search. The significance of this data structure in practical applications is substantiated by empirical examinations of its behaviour.},
  author       = {Edelsbrunner, Herbert and Haring, Günter and Hilbert, D},
  issn         = {1460-2067},
  journal      = {Computer Journal},
  number       = {1},
  pages        = {76 -- 82},
  publisher    = {Oxford University Press},
  title        = {{Rectangular point location in d-dimensions with applications}},
  doi          = {10.1093/comjnl/29.1.76},
  volume       = {29},
  year         = {1986},
}