Rectangular point location in d-dimensions with applications

H. Edelsbrunner, G. Haring, D. Hilbert, Computer Journal 29 (1986) 76–82.

Download
No fulltext has been uploaded. References only!

Journal Article | Published
Author
; ;
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.
Publishing Year
Date Published
1986-01-01
Journal Title
Computer Journal
Volume
29
Issue
1
Page
76 - 82
IST-REx-ID

Cite this

Edelsbrunner H, Haring G, Hilbert D. Rectangular point location in d-dimensions with applications. Computer Journal. 1986;29(1):76-82. doi:10.1093/comjnl/29.1.76
Edelsbrunner, H., Haring, G., & Hilbert, D. (1986). Rectangular point location in d-dimensions with applications. Computer Journal, 29(1), 76–82. https://doi.org/10.1093/comjnl/29.1.76
Edelsbrunner, Herbert, Günter Haring, and D Hilbert. “Rectangular Point Location in D-Dimensions with Applications.” Computer Journal 29, no. 1 (1986): 76–82. https://doi.org/10.1093/comjnl/29.1.76.
H. Edelsbrunner, G. Haring, and D. Hilbert, “Rectangular point location in d-dimensions with applications,” Computer Journal, vol. 29, no. 1, pp. 76–82, 1986.
Edelsbrunner H, Haring G, Hilbert D. 1986. Rectangular point location in d-dimensions with applications. Computer Journal. 29(1), 76–82.
Edelsbrunner, Herbert, et al. “Rectangular Point Location in D-Dimensions with Applications.” Computer Journal, vol. 29, no. 1, Oxford University Press, 1986, pp. 76–82, doi:10.1093/comjnl/29.1.76.

Export

Marked Publications

Open Data IST Research Explorer

Search this title in

Google Scholar