{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T10:14:12Z","timestamp":1648721652431},"reference-count":19,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"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":4156,"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":[[2002,3]]},"DOI":"10.1016\/s0925-7721(01)00026-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:36:39Z","timestamp":1027604199000},"page":"167-175","source":"Crossref","is-referenced-by-count":3,"title":["An elementary algorithm for reporting intersections of red\/blue curve segments"],"prefix":"10.1016","volume":"21","author":[{"given":"Jean-Daniel","family":"Boissonnat","sequence":"first","affiliation":[]},{"given":"Antoine","family":"Vigneron","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0925-7721(01)00026-8_BIB001","series-title":"Proc. 11th ACM Sympos. Comput. Geom.","first-page":"211","article-title":"An optimal algorithm for finding segment intersections","author":"Balaban","year":"1995"},{"issue":"9","key":"10.1016\/S0925-7721(01)00026-8_BIB002","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/TC.1979.1675432","article-title":"Algorithms for reporting and counting geometric intersections","volume":"C-28","author":"Bentley","year":"1979","journal-title":"IEEE Trans. Comput."},{"issue":"5","key":"10.1016\/S0925-7721(01)00026-8_BIB003","doi-asserted-by":"crossref","first-page":"1401","DOI":"10.1137\/S0097539797329373","article-title":"Robust plane sweep for intersecting segments","volume":"29","author":"Boissonnat","year":"2000","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/S0925-7721(01)00026-8_BIB004","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0925-7721(99)00057-7","article-title":"Efficient algorithms for line and curve segment intersection using restricted predicates","volume":"16","author":"Boissonnat","year":"2000","journal-title":"Computational Geometry"},{"issue":"3","key":"10.1016\/S0925-7721(01)00026-8_BIB005","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0020-0190(93)90240-A","article-title":"Range-restricted mergeable priority queues","volume":"47","author":"Bright","year":"1993","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0925-7721(01)00026-8_BIB006","series-title":"Proc. 6th Canad. Conf. Comput. Geom.","first-page":"263","article-title":"A simple trapezoid sweep algorithm for reporting red\/blue segment intersections","author":"Chan","year":"1994"},{"issue":"4","key":"10.1016\/S0925-7721(01)00026-8_BIB007","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0925-7721(00)00012-2","article-title":"Reporting curve segment intersections using restricted predicates","volume":"16","author":"Chan","year":"2000","journal-title":"Computational Geometry"},{"issue":"1","key":"10.1016\/S0925-7721(01)00026-8_BIB008","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\/S0925-7721(01)00026-8_BIB009","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/BF02187740","article-title":"Applications of random sampling in computational geometry, II","volume":"4","author":"Clarkson","year":"1989","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(01)00026-8_BIB010","series-title":"Algorithms\u2014ESA'98","first-page":"175","article-title":"A robust region approach to the computation of geometric graphs","volume":"1461","author":"d'Amore","year":"1998"},{"key":"10.1016\/S0925-7721(01)00026-8_BIB011","series-title":"Proc. 16th Annu. ACM Sympos. Comput. Geom.","first-page":"139","article-title":"Exact predicates for circle arcs arrangements","author":"Devillers","year":"2000"},{"key":"10.1016\/S0925-7721(01)00026-8_BIB012","series-title":"Axioms and Hulls","volume":"606","author":"Knuth","year":"1992"},{"issue":"3","key":"10.1016\/S0925-7721(01)00026-8_BIB013","doi-asserted-by":"crossref","first-page":"864","DOI":"10.1137\/S0097539796305365","article-title":"Robust proximity queries: An illustration of degree-driven algorithm design","volume":"28","author":"Liotta","year":"1998","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0925-7721(01)00026-8_BIB014","series-title":"Workshop on Applications of Interval Analysis to Systems and Control","first-page":"99","article-title":"Interval arithmetic: An efficient implementation and an application to computational geometry","author":"Pion","year":"1999"},{"key":"10.1016\/S0925-7721(01)00026-8_BIB015","series-title":"Computational Geometry: An Introduction","author":"Preparata","year":"1990"},{"key":"10.1016\/S0925-7721(01)00026-8_BIB016","series-title":"Handbook of Computational Geometry","article-title":"Robustness and precision issues in geometric computation","author":"Schirra","year":"2000"},{"issue":"4","key":"10.1016\/S0925-7721(01)00026-8_BIB017","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1145\/359460.359478","article-title":"A data structure for manipulating priority queues","volume":"21","author":"Vuillemin","year":"1978","journal-title":"Comm. ACM"},{"issue":"1","key":"10.1016\/S0925-7721(01)00026-8_BIB018","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0925-7721(95)00040-2","article-title":"Towards exact geometric computation","volume":"7","author":"Yap","year":"1997","journal-title":"Computational Geometry"},{"key":"10.1016\/S0925-7721(01)00026-8_BIB019","series-title":"Handbook of Discrete and Computational Geometry","article-title":"Robust geometric computation","author":"Yap","year":"1997"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772101000268?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772101000268?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T07:51:39Z","timestamp":1556524299000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772101000268"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,3]]}},"alternative-id":["S0925772101000268"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(01)00026-8","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[2002,3]]}}}