{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T11:49:27Z","timestamp":1759146567436},"reference-count":12,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"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":[[1999,1]]},"DOI":"10.1016\/s0020-0190(98)00187-2","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:25:26Z","timestamp":1049736326000},"page":"7-13","source":"Crossref","is-referenced-by-count":5,"title":["Efficient algorithms for counting and reporting pairwise intersections between convex polygons"],"prefix":"10.1016","volume":"69","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(98)00187-2_BIB1","series-title":"Intersection and Decomposition Algorithms for Planar Arrangements","author":"Agarwal","year":"1991"},{"key":"10.1016\/S0020-0190(98)00187-2_BIB2_1","article-title":"Geometric range searching and its relatives","author":"Agarwal","year":"1997"},{"key":"10.1016\/S0020-0190(98)00187-2_BIB2_2","series-title":"Advances in Discrete and Computational Geometry","author":"Agarwal","year":"1998"},{"issue":"1","key":"10.1016\/S0020-0190(98)00187-2_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/7531.24036","article-title":"Intersection of convex objects in two and three dimensions","volume":"34","author":"Chazelle","year":"1987","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/S0020-0190(98)00187-2_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/147508.147511","article-title":"An optimal algorithm for intersecting line segments in the plane","volume":"39","author":"Chazelle","year":"1992","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(98)00187-2_BIB5","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/BF01758854","article-title":"Quasi-optimal upper bounds for simplex range searching and new zone theorems","volume":"8","author":"Chazelle","year":"1992","journal-title":"Algorithmica"},{"key":"10.1016\/S0020-0190(98)00187-2_BIB6","series-title":"Algorithms in Combinatorial Geometry","author":"Edelsbrunner","year":"1987"},{"key":"10.1016\/S0020-0190(98)00187-2_BIB7","series-title":"Proc. Third Italian Conference on Algorithms","first-page":"52","article-title":"On removing nondegeneracy assumptions in computational geometry","author":"G\u00f3mez","year":"1997"},{"key":"10.1016\/S0020-0190(98)00187-2_BIB8","series-title":"Proc. 8th Canadian Conference on Computational Geometry","first-page":"8","article-title":"Efficient algorithms for counting and reporting pairwise intersections between convex polygons","author":"Gupta","year":"1996"},{"key":"10.1016\/S0020-0190(98)00187-2_BIB9","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\/S0020-0190(98)00187-2_BIB10","series-title":"Discrete Mathematics and its Applications","author":"Rosen","year":"1998"},{"key":"10.1016\/S0020-0190(98)00187-2_BIB11","article-title":"New results on data structures in computational geometry","author":"van Kreveld","year":"1992"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098001872?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098001872?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T14:55:20Z","timestamp":1556376920000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019098001872"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["S0020019098001872"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(98)00187-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}