{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:47:19Z","timestamp":1770994039884,"version":"3.50.1"},"reference-count":11,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1997,12,1]],"date-time":"1997-12-01T00:00:00Z","timestamp":880934400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1997,12]]},"DOI":"10.1016\/s0020-0190(97)00183-x","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:55:41Z","timestamp":1052769341000},"page":"263-269","source":"Crossref","is-referenced-by-count":14,"title":["A technique for adding range restrictions to generalized searching problems"],"prefix":"10.1016","volume":"64","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\/S0020-0190(97)00183-X_BIB1","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1007\/BF01940884","article-title":"Polygon and connected component intersection searching","volume":"15","author":"Agarwal","year":"1996","journal-title":"Algorithmica"},{"key":"10.1016\/S0020-0190(97)00183-X_BIB2","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/0020-0190(79)90117-0","article-title":"Decomposable searching problems","volume":"8","author":"Bentley","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(97)00183-X_BIB3","series-title":"Proc. 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\/S0020-0190(97)00183-X_BIB4","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1006\/jagm.1995.1038","article-title":"Further results on generalized intersection searching problems: counting, reporting and dynamization","volume":"19","author":"Gupta","year":"1995","journal-title":"J. Algorithms"},{"key":"10.1016\/S0020-0190(97)00183-X_BIB5","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0925-7721(94)00019-0","article-title":"Algorithms for generalized halfspace range searching and other intersection searching problems","volume":"5","author":"Gupta","year":"1996","journal-title":"Comput. Geom. Theory Appl."},{"key":"10.1016\/S0020-0190(97)00183-X_BIB6","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":"Internat. J. Comput. Geom. Appl."},{"key":"10.1016\/S0020-0190(97)00183-X_BIB7","article-title":"3-D vertical ray shooting and 2-D point enclosure, range searching and arc shooting amidst convex fat objects","author":"Katz","year":"1995","journal-title":"Report INRIA, Nr. 2583"},{"key":"10.1016\/S0020-0190(97)00183-X_BIB8","article-title":"New results on data structures in computational geometry","author":"van Kreveld","year":"1992"},{"key":"10.1016\/S0020-0190(97)00183-X_BIB9","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1051\/ita\/1994280100251","article-title":"Using persistent data structures for adding range restrictions to searching problems","volume":"28","author":"Lenhof","year":"1994","journal-title":"RAIRO Theoret. Inform. Appl."},{"key":"10.1016\/S0020-0190(97)00183-X_BIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0747-7171(89)80002-1","article-title":"General methods for adding range restrictions to decomposable searching problems","volume":"7","author":"Scholten","year":"1989","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/S0020-0190(97)00183-X_BIB11","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1145\/3828.3839","article-title":"Adding range restriction capability to dynamic data structures","volume":"32","author":"Willard","year":"1985","journal-title":"J. ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001909700183X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001909700183X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T12:54:28Z","timestamp":1556628868000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S002001909700183X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,12]]},"references-count":11,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1997,12]]}},"alternative-id":["S002001909700183X"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(97)00183-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1997,12]]}}}