{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T19:36:53Z","timestamp":1703187413991},"reference-count":22,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6347,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[1996,3]]},"DOI":"10.1016\/0925-7721(94)00019-0","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:19:33Z","timestamp":1049721573000},"page":"321-340","source":"Crossref","is-referenced-by-count":8,"title":["Algorithms for generalized halfspace range searching and other intersection searching problems"],"prefix":"10.1016","volume":"5","author":[{"given":"Prosenjit","family":"Gupta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ravi","family":"Janardan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michiel","family":"Smid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0925-7721(94)00019-0_BIB1","series-title":"Proceedings of the 3rd Workshop on Algorithms and Data Structures","first-page":"36","article-title":"Connected component and simple polygon intersection searching","author":"Agarwal","year":"1993"},{"key":"10.1016\/0925-7721(94)00019-0_BIB2","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1006\/jagm.1993.1040","article-title":"Intersection queries for curved objects","volume":"15","author":"Agarwal","year":"1993","journal-title":"J. Algorithms"},{"key":"10.1016\/0925-7721(94)00019-0_BIB3","series-title":"Proceedings of the 22nd Annual ACM Symposium on Theory of Computing","first-page":"331","article-title":"Solving query-retrieval problems by compacting Voronoi diagrams","author":"Aggarwal","year":"1990"},{"key":"10.1016\/0925-7721(94)00019-0_BIB4","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1137\/0215051","article-title":"Filtering search: a new approach to query-answering","volume":"15","author":"Chazelle","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0925-7721(94)00019-0_BIB5","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/BF01934990","article-title":"The power of geometric duality","volume":"25","author":"Chazelle","year":"1985","journal-title":"BIT"},{"key":"10.1016\/0925-7721(94)00019-0_BIB6","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1016\/0196-6774(92)90062-H","article-title":"Algorithms for ray-shooting and intersection searching","volume":"13","author":"Cheng","year":"1992","journal-title":"J. Algorithms"},{"key":"10.1016\/0925-7721(94)00019-0_BIB7","series-title":"Proceedings of the 19th Annual ACM Symposium on Theory of Computing","first-page":"365","article-title":"Two algorithms for maintaining order in a list","author":"Dietz","year":"1987"},{"key":"10.1016\/0925-7721(94)00019-0_BIB8","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/0196-6774(87)90015-0","article-title":"Space searching for intersecting objects","volume":"8","author":"Dobkin","year":"1987","journal-title":"J. Algorithms"},{"key":"10.1016\/0925-7721(94)00019-0_BIB9","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/0022-0000(89)90034-2","article-title":"Making data structures persistent","volume":"38","author":"Driscoll","year":"1989","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0925-7721(94)00019-0_BIB10","series-title":"Algorithms in Combinatorial Geometry","author":"Edelsbrunner","year":"1987"},{"key":"10.1016\/0925-7721(94)00019-0_BIB11","article-title":"Efficient algorithms for generalized intersection searching on non-iso-oriented objects","author":"Gupta","year":"1993"},{"key":"10.1016\/0925-7721(94)00019-0_BIB12","doi-asserted-by":"crossref","DOI":"10.1006\/jagm.1995.1038","article-title":"Further results on generalized intersection searching problems: counting, reporting, and dynamization","author":"Gupta","year":"1995","journal-title":"J. Algorithms"},{"key":"10.1016\/0925-7721(94)00019-0_BIB13","series-title":"Proceedings of the 4th Scandinavian Workshop on Algorithm Theory","first-page":"183","article-title":"On intersection searching problems involving curved objects","volume":"Vol. 824","author":"Gupta","year":"1994"},{"key":"10.1016\/0925-7721(94)00019-0_BIB14","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1142\/S021819599300004X","article-title":"Generalized intersection searching problems","volume":"3","author":"Janardan","year":"1993","journal-title":"Interna. J. Comput. Geom. Appl."},{"key":"10.1016\/0925-7721(94)00019-0_BIB15","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF02574697","article-title":"Cutting hyperplane arrangements","volume":"6","author":"Matou\u0161ek","year":"1991","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(94)00019-0_BIB16","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF02293051","article-title":"Efficient partition trees","volume":"8","author":"Matou\u0161ek","year":"1992","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(94)00019-0_BIB17","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02573972","article-title":"Range searching with efficient hierarchical cuttings","volume":"10","author":"Matou\u0161ek","year":"1992","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(94)00019-0_BIB18","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF02573975","article-title":"On ray shooting in convex polytopes","volume":"10","author":"Matou\u0161ek","year":"1993","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(94)00019-0_BIB19","doi-asserted-by":"crossref","first-page":"1034","DOI":"10.1137\/0220065","article-title":"New upper bounds in Klee's measure problem","volume":"20","author":"Overmars","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0925-7721(94)00019-0_BIB20","series-title":"Theoretical Foundations of Computer Graphics and CAD","first-page":"253","article-title":"Davenport-schinzel sequences and their geometric applications","author":"Sharir","year":"1988"},{"key":"10.1016\/0925-7721(94)00019-0_BIB21","article-title":"New results on data structures in computational geometry","author":"van Kreveld","year":"1992"},{"key":"10.1016\/0925-7721(94)00019-0_BIB22","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF02187686","article-title":"More on k-sets of finite sets in the plane","volume":"1","author":"Welzl","year":"1986","journal-title":"Discrete Comput. Geom."}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772194000190?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772194000190?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T04:21:30Z","timestamp":1554697290000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0925772194000190"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":22,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["0925772194000190"],"URL":"https:\/\/doi.org\/10.1016\/0925-7721(94)00019-0","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1996,3]]}}}