{"issue":"1","date_created":"2018-12-11T12:07:03Z","oa":1,"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","month":"03","title":"Optimal solutions for a class of point retrieval problems","doi":"10.1016/S0747-7171(85)80028-6","page":"47 - 56","article_processing_charge":"No","publication_status":"published","main_file_link":[{"open_access":"1","url":"https://www.sciencedirect.com/science/article/pii/S0747717185800286?via%3Dihub"}],"quality_controlled":"1","intvolume":"         1","extern":"1","acknowledgement":"The first author was supported i~1 part by NSF grants MCS 83-03925 and the Office of Naval Research and the Defense Advanced Research Projects Agency under contract N00014-g3-K-0146 and ARPA Order No. 4786.","author":[{"last_name":"Chazelle","full_name":"Chazelle, Bernard","first_name":"Bernard"},{"first_name":"Herbert","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}],"publication_identifier":{"issn":["0747-7171"],"eissn":["1095-855X"]},"_id":"4120","date_updated":"2022-01-31T09:20:18Z","article_type":"original","publication":"Journal of Symbolic Computation","publisher":"Elsevier","status":"public","day":"01","year":"1985","volume":1,"date_published":"1985-03-01T00:00:00Z","oa_version":"Published Version","publist_id":"2004","citation":{"ama":"Chazelle B, Edelsbrunner H. Optimal solutions for a class of point retrieval problems. <i>Journal of Symbolic Computation</i>. 1985;1(1):47-56. doi:<a href=\"https://doi.org/10.1016/S0747-7171(85)80028-6\">10.1016/S0747-7171(85)80028-6</a>","ista":"Chazelle B, Edelsbrunner H. 1985. Optimal solutions for a class of point retrieval problems. Journal of Symbolic Computation. 1(1), 47–56.","ieee":"B. Chazelle and H. Edelsbrunner, “Optimal solutions for a class of point retrieval problems,” <i>Journal of Symbolic Computation</i>, vol. 1, no. 1. Elsevier, pp. 47–56, 1985.","short":"B. Chazelle, H. Edelsbrunner, Journal of Symbolic Computation 1 (1985) 47–56.","mla":"Chazelle, Bernard, and Herbert Edelsbrunner. “Optimal Solutions for a Class of Point Retrieval Problems.” <i>Journal of Symbolic Computation</i>, vol. 1, no. 1, Elsevier, 1985, pp. 47–56, doi:<a href=\"https://doi.org/10.1016/S0747-7171(85)80028-6\">10.1016/S0747-7171(85)80028-6</a>.","apa":"Chazelle, B., &#38; Edelsbrunner, H. (1985). Optimal solutions for a class of point retrieval problems. <i>Journal of Symbolic Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/S0747-7171(85)80028-6\">https://doi.org/10.1016/S0747-7171(85)80028-6</a>","chicago":"Chazelle, Bernard, and Herbert Edelsbrunner. “Optimal Solutions for a Class of Point Retrieval Problems.” <i>Journal of Symbolic Computation</i>. Elsevier, 1985. <a href=\"https://doi.org/10.1016/S0747-7171(85)80028-6\">https://doi.org/10.1016/S0747-7171(85)80028-6</a>."},"abstract":[{"text":"Let P be a set of n points in the Euclidean plane and let C be a convex figure. We study the problem of preprocessing P so that for any query point q, the points of P in C+q can be retrieved efficiently. If constant time sumces for deciding the inclusion of a point in C, we then demonstrate the existence of an optimal solution: the algorithm requires O(n) space and O(k + log n) time for a query with output size k. If C is a disk, the problem becomes the wellknown fixed-radius neighbour problem, to which we thus provide the first known optimal solution.","lang":"eng"}],"language":[{"iso":"eng"}],"type":"journal_article"}