[{"date_created":"2018-12-11T12:06:59Z","citation":{"chicago":"Edelsbrunner, Herbert, Günter Haring, and D Hilbert. “Rectangular Point Location in D-Dimensions with Applications.” <i>Computer Journal</i>. Oxford University Press, 1986. <a href=\"https://doi.org/10.1093/comjnl/29.1.76\">https://doi.org/10.1093/comjnl/29.1.76</a>.","ieee":"H. Edelsbrunner, G. Haring, and D. Hilbert, “Rectangular point location in d-dimensions with applications,” <i>Computer Journal</i>, vol. 29, no. 1. Oxford University Press, pp. 76–82, 1986.","ista":"Edelsbrunner H, Haring G, Hilbert D. 1986. Rectangular point location in d-dimensions with applications. Computer Journal. 29(1), 76–82.","apa":"Edelsbrunner, H., Haring, G., &#38; Hilbert, D. (1986). Rectangular point location in d-dimensions with applications. <i>Computer Journal</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/comjnl/29.1.76\">https://doi.org/10.1093/comjnl/29.1.76</a>","mla":"Edelsbrunner, Herbert, et al. “Rectangular Point Location in D-Dimensions with Applications.” <i>Computer Journal</i>, vol. 29, no. 1, Oxford University Press, 1986, pp. 76–82, doi:<a href=\"https://doi.org/10.1093/comjnl/29.1.76\">10.1093/comjnl/29.1.76</a>.","short":"H. Edelsbrunner, G. Haring, D. Hilbert, Computer Journal 29 (1986) 76–82.","ama":"Edelsbrunner H, Haring G, Hilbert D. Rectangular point location in d-dimensions with applications. <i>Computer Journal</i>. 1986;29(1):76-82. doi:<a href=\"https://doi.org/10.1093/comjnl/29.1.76\">10.1093/comjnl/29.1.76</a>"},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","extern":"1","issue":"1","article_processing_charge":"No","intvolume":"        29","month":"01","publist_id":"2013","publication_identifier":{"issn":["0010-4620"],"eissn":["1460-2067"]},"quality_controlled":"1","publication":"Computer Journal","title":"Rectangular point location in d-dimensions with applications","article_type":"original","volume":29,"doi":"10.1093/comjnl/29.1.76","language":[{"iso":"eng"}],"year":"1986","publisher":"Oxford University Press","date_updated":"2022-02-01T09:17:51Z","status":"public","type":"journal_article","author":[{"orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert","full_name":"Edelsbrunner, Herbert"},{"last_name":"Haring","first_name":"Günter","full_name":"Haring, Günter"},{"last_name":"Hilbert","full_name":"Hilbert, D","first_name":"D"}],"_id":"4109","day":"01","page":"76 - 82","oa_version":"None","publication_status":"published","date_published":"1986-01-01T00:00:00Z","abstract":[{"text":"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.","lang":"eng"}]}]