{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:58:09Z","timestamp":1775282289892,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1987,6,1]],"date-time":"1987-06-01T00:00:00Z","timestamp":549504000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[1987,6]]},"DOI":"10.1007\/bf02187875","type":"journal-article","created":{"date-parts":[[2005,10,29]],"date-time":"2005-10-29T08:51:54Z","timestamp":1130575914000},"page":"113-126","source":"Crossref","is-referenced-by-count":25,"title":["Linear space data structures for two types of range search"],"prefix":"10.1007","volume":"2","author":[{"given":"Bernard","family":"Chazelle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Herbert","family":"Edelsbrunner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1987,7,1]]},"reference":[{"key":"BF02187875_CR1","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1145\/358841.358850","volume":"23","author":"J. L. Bentley","year":"1980","unstructured":"J. L. Bentley, Multidimensional divide and conquer,Comm. ACM 23 (1980), 214\u2013229.","journal-title":"Comm. ACM"},{"key":"BF02187875_CR2","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1137\/0215051","volume":"15","author":"B. Chazelle","year":"1986","unstructured":"B. Chazelle, Filtering search: a new approach to query-answering,SIAM J. Comput. 15 (1986), 703\u2013724.","journal-title":"SIAM J. Comput."},{"key":"BF02187875_CR3","doi-asserted-by":"crossref","unstructured":"B. Chazelle, A Functional Approach to Data Structures and Its Use in Multidimensional Searching, Technical Report No. CS-85-16, Brown University, 1985. Preliminary version inProceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, 165\u2013174, 1985.","DOI":"10.1109\/SFCS.1985.51"},{"key":"BF02187875_CR4","doi-asserted-by":"crossref","unstructured":"B. Chazelle, Lower bounds on the complexity of multidimensional searching,Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science, 87\u201396, 1986.","DOI":"10.1109\/SFCS.1986.29"},{"key":"BF02187875_CR5","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/S0747-7171(85)80028-6","volume":"1","author":"B. Chazelle","year":"1985","unstructured":"B. Chazelle and H. Edelsbrunner, Optimal solutions for a class of point retrieval problems,J. Symbolic Comput. 1 (1985), 47\u201356.","journal-title":"J. Symbolic Comput."},{"key":"BF02187875_CR6","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF01840440","volume":"1","author":"B. Chazelle","year":"1986","unstructured":"B. Chazelle and L. J. Guibas, Fractional cascading: I. A data structuring technique,Algorithmica 1 (1986), 133\u2013162.","journal-title":"Algorithmica"},{"key":"BF02187875_CR7","doi-asserted-by":"crossref","unstructured":"B. Chazelle, L. J. Guibas, and D. T. Lee, The power of geometric duality,Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science, 217\u2013225, 1983. Also inBIT 25 (1985), 76\u201390.","DOI":"10.1007\/BF01934990"},{"key":"BF02187875_CR8","doi-asserted-by":"crossref","unstructured":"D. P. Dobkin and H. Edelsbrunner, Space searching for interesting objects,Proceedings of the 25th Annual IEEE Symposium on Foundations of Computer Science, 387\u2013392, 1984.","DOI":"10.1109\/SFCS.1984.715939"},{"key":"BF02187875_CR9","unstructured":"H. Edelsbrunner and E. Welzl, Halfplanar range search in linear space andO(n 0.695) query time,Inform. Process. Lett., to appear."},{"key":"BF02187875_CR10","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1137\/0215023","volume":"15","author":"H. Edelsbrunner","year":"1986","unstructured":"H. Edelsbrunner, L. J. Guibas, and J. Stolfi, Optimal point location in a monotone subdivision,SIAM J. Comput. 15 (1986), 317\u2013340.","journal-title":"SIAM J. Comput."},{"key":"BF02187875_CR11","doi-asserted-by":"crossref","unstructured":"H. N. Gabow, J. L. Bentley, and R. E. Tarjan, Scaling and related techniques for geometry problems,Proceedings of the 16th Annual ACM Symposium on Theory of Computation, 135\u2013143, 1984.","DOI":"10.1145\/800057.808675"},{"key":"BF02187875_CR12","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/282918.282923","volume":"4","author":"L. J. Guibas","year":"1985","unstructured":"L. J. Guibas and J. Stolfi, Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams,ACM Trans. Graphics 4 (1985), 74\u2013123.","journal-title":"ACM Trans. Graphics"},{"key":"BF02187875_CR13","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/0212002","volume":"12","author":"D. G. Kirkpatrick","year":"1983","unstructured":"D. G. Kirkpatrick, Optimal search in planar subdivisions,SIAM J. Comput. 12 (1983), 28\u201335.","journal-title":"SIAM J. Comput."},{"key":"BF02187875_CR14","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1145\/321906.321910","volume":"22","author":"H. T. Kung","year":"1975","unstructured":"H. T. Kung, F. Luccio, and F. P. Preparata, On finding the maxima of a set of vectors,J. Assoc. Comput. Mach. 22 (1975), 469\u2013476.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF02187875_CR15","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1137\/0209046","volume":"9","author":"R. J. Lipton","year":"1980","unstructured":"R. J. Lipton and R. E. Tarjan, Applications of a planar separator theorem,SIAM J. Comput. 9 (1980), 615\u2013627.","journal-title":"SIAM J. Comput."},{"key":"BF02187875_CR16","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1137\/0214021","volume":"14","author":"E. M. McCreight","year":"1985","unstructured":"E. M. McCreight, Priority search trees,SIAM. J. Comput. 14 (1985), 257\u2013276.","journal-title":"SIAM. J. Comput."},{"key":"BF02187875_CR17","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0304-3975(78)90051-8","volume":"7","author":"D. E. Muller","year":"1978","unstructured":"D. E. Muller and F. P. Preparata, Finding the intersection of two convex polyhedra,Theoret. Comput. Sci. 7 (1978), 217\u2013236.","journal-title":"Theoret. Comput. Sci."},{"key":"BF02187875_CR18","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1137\/0211012","volume":"11","author":"D. E. Willard","year":"1982","unstructured":"D. E. Willard, Polygon retrieval,SIAM J. Comput. 11 (1982), 149\u2013165.","journal-title":"SIAM J. Comput."},{"key":"BF02187875_CR19","doi-asserted-by":"crossref","unstructured":"F. F. Yao, A 3-space partition and its applications,Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 258\u2013263, 1983.","DOI":"10.1145\/800061.808755"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02187875.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02187875\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02187875","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T07:34:28Z","timestamp":1736062468000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02187875"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,6]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,6]]}},"alternative-id":["BF02187875"],"URL":"https:\/\/doi.org\/10.1007\/bf02187875","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,6]]}}}