{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T14:18:35Z","timestamp":1762179515578,"version":"build-2065373602"},"reference-count":20,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1984,10,1]],"date-time":"1984-10-01T00:00:00Z","timestamp":465436800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1984,10,1]],"date-time":"1984-10-01T00:00:00Z","timestamp":465436800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"vor","delay-in-days":10517,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/100004316","name":"International Business Machines Corporation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100004316","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DCR-84-01633"],"award-info":[{"award-number":["DCR-84-01633"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000879","name":"Alfred P. Sloan Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000879","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100004316","name":"International Business Machines Corporation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100004316","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-82-K-0381"],"award-info":[{"award-number":["N00014-82-K-0381"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information and Control"],"published-print":{"date-parts":[[1984,10]]},"DOI":"10.1016\/s0019-9958(84)80040-6","type":"journal-article","created":{"date-parts":[[2005,5,3]],"date-time":"2005-05-03T07:12:14Z","timestamp":1115104334000},"page":"39-57","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":19,"title":["Geometric retrieval problems"],"prefix":"10.1016","volume":"63","author":[{"given":"Richard","family":"Cole","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chee K.","family":"Yap","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(84)80040-6_bib1","first-page":"133","article-title":"A note on Euclidean near neighbor searching in the plane","volume":"8","author":"Bentley","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0019-9958(84)80040-6_bib2","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/0020-0190(75)90034-4","article-title":"Analysis of range queries in quad trees","volume":"3","author":"Bentley","year":"1975","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0019-9958(84)80040-6_bib3","unstructured":"Cole, R. (in press.) Searching and storing similar lists, J. Algorithms."},{"key":"10.1016\/S0019-9958(84)80040-6_bib4","series-title":"Proc. 24th IEEE Found. Comput. Sci.","first-page":"122","article-title":"Filtering search: A new approach to query answering","author":"Chazelle","year":"1983"},{"key":"10.1016\/S0019-9958(84)80040-6_bib5","series-title":"Proc. 24th IEEE Found. Comput. Sci.","first-page":"217","article-title":"The power of geometric duality","author":"Chazelle","year":"1983"},{"issue":"No. 2","key":"10.1016\/S0019-9958(84)80040-6_bib6","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1137\/0205015","article-title":"Multidimensional searching problems","volume":"5","author":"Dobkin","year":"1976","journal-title":"SIAM J. Comput."},{"issue":"No. 2","key":"10.1016\/S0019-9958(84)80040-6_bib7","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/0020-0190(82)90090-4","article-title":"Polygonal intersection searching","volume":"14","author":"Edelsbrunner","year":"1982","journal-title":"Inform. Process. Lett."},{"article-title":"Halfplanar Range Search in Linear Space and O(n0.695) Query Time","year":"1983","author":"Edelsbrunner","key":"10.1016\/S0019-9958(84)80040-6_bib8"},{"key":"10.1016\/S0019-9958(84)80040-6_bib9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00288933","article-title":"Quad trees, a data structure for retrieval on composite keys","volume":"4","author":"Finkel","year":"1974","journal-title":"Acta Inform."},{"issue":"No. 1","key":"10.1016\/S0019-9958(84)80040-6_bib10","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/0212002","article-title":"Optimal search in planar subdivisions","volume":"12","author":"Kirkpatrick","year":"1983","journal-title":"SIAM J. Comput."},{"issue":"No. 6","key":"10.1016\/S0019-9958(84)80040-6_bib11","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1109\/TC.1982.1676031","article-title":"On k-nearest neighbor Voronoi diagrams in the plane","volume":"C-31","author":"Lee","year":"1982","journal-title":"IEEE Trans. Comput."},{"issue":"No. 3","key":"10.1016\/S0019-9958(84)80040-6_bib12","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1137\/0206043","article-title":"Location of a point in a planar subdivision and its applications","volume":"6","author":"Lee","year":"1977","journal-title":"SIAM J. Comput."},{"issue":"No. 3","key":"10.1016\/S0019-9958(84)80040-6_bib13","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1137\/0209046","article-title":"Applications of a planar separator theorem","volume":"9","author":"Lipton","year":"1980","journal-title":"SIAM. J. Comput."},{"key":"10.1016\/S0019-9958(84)80040-6_bib14","series-title":"Proc. 19th IEEE Found. Comput. Sci.","first-page":"28","article-title":"A data structure for orthogonal range queries","author":"Lueker","year":"1978"},{"issue":"No. 4","key":"10.1016\/S0019-9958(84)80040-6_bib15","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1137\/0208043","article-title":"A note on locating a set of points in a planar subdivision","volume":"8","author":"Preparata","year":"1979","journal-title":"SIAM J. Comput."},{"issue":"No. 3","key":"10.1016\/S0019-9958(84)80040-6_bib16","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1137\/0210035","article-title":"A new approach to planar point location","volume":"10","author":"Preparata","year":"1981","journal-title":"SIAM J. Comput."},{"issue":"No. 1","key":"10.1016\/S0019-9958(84)80040-6_bib17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/356625.356626","article-title":"A characterization of ten hidden-surface algorithms","volume":"6","author":"Sutherland","year":"1974","journal-title":"Comput. Surveys"},{"issue":"No. 1","key":"10.1016\/S0019-9958(84)80040-6_bib18","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1137\/0211012","article-title":"Polygon retrieval","volume":"11","author":"Willard","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0019-9958(84)80040-6_bib19","series-title":"Proc. 15th ACM Sympos. Theory of Comput.","first-page":"258","article-title":"A 3-space partition and its applications","author":"Yao","year":"1983"},{"key":"10.1016\/S0019-9958(84)80040-6_bib20","series-title":"Proc. 21st IEEE Found. Comput. Sci.","first-page":"301","article-title":"On the priority approach to hidden surface algorithms","author":"Yao","year":"1980"}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995884800406?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995884800406?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T13:30:09Z","timestamp":1762176609000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995884800406"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,10]]},"references-count":20,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1984,10]]}},"alternative-id":["S0019995884800406"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(84)80040-6","relation":{},"ISSN":["0019-9958"],"issn-type":[{"type":"print","value":"0019-9958"}],"subject":[],"published":{"date-parts":[[1984,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Geometric retrieval problems","name":"articletitle","label":"Article Title"},{"value":"Information and Control","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0019-9958(84)80040-6","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1984 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}