{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T22:53:01Z","timestamp":1762210381521,"version":"3.44.0"},"reference-count":19,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1986,6,1]],"date-time":"1986-06-01T00:00:00Z","timestamp":517968000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1986,6,1]],"date-time":"1986-06-01T00:00:00Z","timestamp":517968000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2005,9,3]],"date-time":"2005-09-03T00:00:00Z","timestamp":1125705600000},"content-version":"vor","delay-in-days":7034,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1986,6]]},"DOI":"10.1016\/0196-6774(86)90004-0","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T03:44:36Z","timestamp":1108007076000},"page":"202-220","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":72,"title":["Searching and storing similar lists"],"prefix":"10.1016","volume":"7","author":[{"given":"Richard","family":"Cole","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(86)90004-0_BIB1","first-page":"133","article-title":"A note on Euclidean near neighbor searching in the plane","volume":"8","author":"Bently","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0196-6774(86)90004-0_BIB2","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/S0019-9958(85)80045-0","article-title":"How to search in history","volume":"64","author":"Chazelle","year":"1985","journal-title":"Inform. and Control"},{"key":"10.1016\/0196-6774(86)90004-0_BIB3","series-title":"Proc. 24th IEEE Found. of Comput. Sci.","first-page":"122","article-title":"Filtering Search: A new Approach to Query Answering","author":"Chazelle","year":"1983"},{"key":"10.1016\/0196-6774(86)90004-0_BIB4","unstructured":"R. Cole and C. Yap, Geometric Retrieval Problems, Inform. and Control, in press."},{"key":"10.1016\/0196-6774(86)90004-0_BIB5","series-title":"Proc. 9th Colloquium on Automata, Languages and Programming","first-page":"154","article-title":"Fast detection of polyhedral intersections","author":"Dobkin","year":"1980"},{"issue":"2","key":"10.1016\/0196-6774(86)90004-0_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."},{"key":"10.1016\/0196-6774(86)90004-0_BIB7","series-title":"Proc. 21st IEEE Found. of Comput. Sci.","first-page":"200","article-title":"Efficient uses of the past","author":"Dobkin","year":"1980"},{"key":"10.1016\/0196-6774(86)90004-0_BIB8","unstructured":"H. Edelsbrunner, L. Guibas, and J. Stolfi, Optimal Point location in a monotone subdivision, SIAM J. Comput., in press."},{"key":"10.1016\/0196-6774(86)90004-0_BIB9","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/0304-3975(81)90103-1","article-title":"A space-optimal solution of general region location","volume":"16","author":"Edelsbrunner","year":"1981","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/0196-6774(86)90004-0_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."},{"key":"10.1016\/0196-6774(86)90004-0_BIB11","unstructured":"D. Kirkpatrick, Private communication."},{"issue":"6","key":"10.1016\/0196-6774(86)90004-0_BIB12","first-page":"478","article-title":"On k-nearest neighbor Voronoi diagrams in the plane","volume":"31","author":"Lee","year":"1982","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"10.1016\/0196-6774(86)90004-0_BIB13","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1137\/0206043","article-title":"Location of a point in a planar subdivision and its application","volume":"6","author":"Lee","year":"1977","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/0196-6774(86)90004-0_BIB14","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1137\/0209046","article-title":"Applications of a planar separation theorem","volume":"9","author":"Lipton","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(86)90004-0_BIB15","article-title":"Searching in the Past, I","author":"Overmars","year":"1981","journal-title":"Univ. of Utrecht, Technical Report, No. RUU-CS-81-7"},{"key":"10.1016\/0196-6774(86)90004-0_BIB16","article-title":"Searching in the past, II, Univ. of Utrecht","author":"Overmars","year":"1981","journal-title":"Technical Report, No. RUU-CS-81-9"},{"issue":"3","key":"10.1016\/0196-6774(86)90004-0_BIB17","doi-asserted-by":"crossref","first-page":"478","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":"1","key":"10.1016\/0196-6774(86)90004-0_BIB18","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":"1","key":"10.1016\/0196-6774(86)90004-0_BIB19","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1137\/0214019","article-title":"New data structures for orthogonal range queries","volume":"14","author":"Willard","year":"1985","journal-title":"SIAM J. Comput."}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677486900040?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677486900040?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T00:13:34Z","timestamp":1757463214000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677486900040"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,6]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1986,6]]}},"alternative-id":["0196677486900040"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(86)90004-0","relation":{},"ISSN":["0196-6774"],"issn-type":[{"type":"print","value":"0196-6774"}],"subject":[],"published":{"date-parts":[[1986,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Searching and storing similar lists","name":"articletitle","label":"Article Title"},{"value":"Journal of Algorithms","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0196-6774(86)90004-0","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1986 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}