{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:03:12Z","timestamp":1725663792729},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540571551"},{"type":"electronic","value":"9783540479185"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57155-8_277","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:07:12Z","timestamp":1330258032000},"page":"530-540","source":"Crossref","is-referenced-by-count":6,"title":["Counting and reporting red\/blue segment intersections"],"prefix":"10.1007","author":[{"given":"Larry","family":"Palazzi","sequence":"first","affiliation":[]},{"given":"Jack","family":"Snoeyink","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"issue":"9","key":"49_CR1","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/TC.1979.1675432","volume":"C-28","author":"J. L. Bentley","year":"1979","unstructured":"J. L. Bentley and T. A. Ottmann. Algorithms for reporting and counting geometric intersections. IEEE Transactions on Computers, C-28(9):643\u2013647, 1979.","journal-title":"IEEE Transactions on Computers"},{"key":"49_CR2","doi-asserted-by":"crossref","unstructured":"B. Chazelle and H. Edelsbrunner. An optimal algorithm for intersecting line segments in the plane. In Proceedings of the 29th IEEE Symposium on Foundations of Computer Science, pages 590\u2013600, 1988.","DOI":"10.1109\/SFCS.1988.21975"},{"key":"49_CR3","unstructured":"B. Chazelle, H. Edelsbrunner, L. Guibas, and M. Sharir. Algorithms for bichromatic line segment problems and polyhedral terrains. Technical Report UIUC DCS-R-90-1578, Dept. Comp. Sci., Univ. Ill. Urbana, 1990."},{"key":"49_CR4","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:133\u2013162, 1986.","journal-title":"Algorithmica"},{"key":"49_CR5","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF01840441","volume":"1","author":"B. Chazelle","year":"1986","unstructured":"B. Chazelle and L. J. Guibas. Fractional cascading: II. Applications. Algorithmica, 1:163\u2013191, 1986.","journal-title":"Algorithmica"},{"key":"49_CR6","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1016\/0196-6774(85)90030-6","volume":"6","author":"H. Edelsbrunner","year":"1985","unstructured":"H. Edelsbrunner and M. H. Overmars. Batched dynamic solutions to decomposable searching problems. Journal of Algorithms, 6:515\u2013542, 1985.","journal-title":"Journal of Algorithms"},{"key":"49_CR7","unstructured":"ESRI White Paper Series. Environmental Systems Research Institute, Inc. ARC\/INFO: GIS Today and Tomorrow, Mar. 1992."},{"key":"49_CR8","unstructured":"Federal Geomatics Bulletin, 4(1), 1992. GIS Division, Energy, Mines and Resources. Ottawa, Canada."},{"key":"49_CR9","unstructured":"D. E. Knuth. Fundamental Algorithms, volume 1 of The Art of Computer Programming. Addison-Wesley, second edition, 1973."},{"key":"49_CR10","doi-asserted-by":"crossref","unstructured":"H. G. Mairson and J. Stolfi. Reporting line segment intersections. In R. Earnshaw, editor, Theoretical Foundations of Computer Graphics and CAD, number F40 in NATO ASI Series, pages 307\u2013326. Springer-Verlag, 1988.","DOI":"10.1007\/978-3-642-83539-1_11"},{"key":"49_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry\u2014An Introduction","author":"F. P. Preparata","year":"1985","unstructured":"F. P. Preparata and M. I. Shamos. Computational Geometry\u2014An Introduction. Springer-Verlag, New York, 1985."},{"key":"49_CR12","doi-asserted-by":"crossref","unstructured":"M. I. Shamos and D. Hoey, Geometric intersection problems. In Proceedings of the 17th IEEE Symposium on Foundations of Computer Science, pages 208\u2013215, 1976.","DOI":"10.1109\/SFCS.1976.16"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57155-8_277.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:58:44Z","timestamp":1619571524000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57155-8_277"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571551","9783540479185"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-57155-8_277","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}