{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:03:02Z","timestamp":1725663782596},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540571551"},{"type":"electronic","value":"9783540479185"}],"license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57155-8_234","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T07:06:54Z","timestamp":1330240014000},"page":"36-47","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Connected component and simple polygon intersection searching"],"prefix":"10.1007","author":[{"given":"Pankaj K.","family":"Agarwal","sequence":"first","affiliation":[]},{"given":"Marc","family":"van Kreveld","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1007\/BF02187809","volume":"5","author":"P. K. Agarwal","year":"1991","unstructured":"Agarwal, P. K., Partitioning Arrangements of Lines: II. Applications, Discr. & Comp. Geom.\n5 (1991), pp. 533\u2013573.","journal-title":"Discr. & Comp. Geom."},{"key":"6_CR2","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1137\/0221035","volume":"21","author":"P. K. Agarwal","year":"1992","unstructured":"Agarwal, P. K., Ray Shooting and other Applications of Spanning Trees with Low-Stabbing Number, SIAM J. Computing\n21 (1992), 540\u2013570.","journal-title":"SIAM J. Computing"},{"key":"6_CR3","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BF02189304","volume":"9","author":"P. K. Agarwal","year":"1993","unstructured":"Agarwal, P. K., and M. Sharir, Applications of a New Space Partitioning Technique, Discrete & Computational Geometry 9 (1993), 11\u201338.","journal-title":"Discrete & Computational Geometry"},{"key":"6_CR4","volume-title":"Introduction to Algorithms","author":"T. H. Cormen","year":"1990","unstructured":"Cormen, T. H., C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, MIT Press, Cambridge, 1990."},{"key":"6_CR5","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1145\/128749.128750","volume":"39","author":"M. Dillencourt","year":"1992","unstructured":"Dillencourt M., H. Samet, and M. Tammiuen, A general approach to connected component labeling for arbitrary image representation, JACM\n39 (1992), pp. 253\u2013280.","journal-title":"JACM"},{"key":"6_CR6","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/0196-6774(87)90015-0","volume":"8","author":"D. P. Dobkin","year":"1987","unstructured":"Dobkin, D. P., and H. Edelsbrunner, Space Searching for Intersecting Objects, J. Algorithms\n8 (1987), pp. 348\u2013361.","journal-title":"J. Algorithms"},{"key":"6_CR7","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1016\/0196-6774(83)90012-3","volume":"4","author":"H. Imai","year":"1984","unstructured":"Imai, H., and T. Asano, Finding the Connected Components and a Maximum Clique of an Intersection Graph of Rectangles in the Plane, J. Algorithms\n4 (1984), pp. 310\u2013323.","journal-title":"J. Algorithms"},{"key":"6_CR8","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1142\/S021819599300004X","volume":"3","author":"R. Janardan","year":"1993","unstructured":"Janardan, R., and M. Lopez, Generalized Intersection Searching Problems, Int. J. Comp. Geom. & Appl.\n3 (1993), 39\u201370.","journal-title":"Int. J. Comp. Geom. & Appl."},{"key":"6_CR9","first-page":"315","volume":"8","author":"J. Matou\u0161ek","year":"1992","unstructured":"Matou\u0161ek, J., Efficient Partition Trees, 8 (1992), pp. 315\u2013334.","journal-title":"Efficient Partition Trees"},{"key":"6_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69900-9","volume-title":"Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry","author":"K. Mehlhorn","year":"1984","unstructured":"Mehlhorn, K., Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry, Springer-Verlag, Heidelberg, 1984."},{"key":"6_CR11","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1145\/359131.359132","volume":"22","author":"F.P. Preparata","year":"1979","unstructured":"Preparata, F.P., An optimal real time algorithm for planar convex hulls, CACM\n22 (1979), pp. 402\u2013405.","journal-title":"CACM"},{"key":"6_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0747-7171(89)80002-1","volume":"7","author":"H. W. Scholten","year":"1989","unstructured":"Scholten, H. W., and M. H. Overmars, General Methods for Adding Range Restrictions to Decomposable Searching Problems, J. Symb. Comp.\n7 (1989), pp. 1\u201310.","journal-title":"J. Symb. Comp."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57155-8_234","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T21:18:33Z","timestamp":1578518313000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57155-8_234"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571551","9783540479185"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-57155-8_234","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]},"assertion":[{"value":"9 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}