{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T19:45:52Z","timestamp":1750103152808},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662495285"},{"type":"electronic","value":"9783662495292"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49529-2_22","type":"book-chapter","created":{"date-parts":[[2016,3,21]],"date-time":"2016-03-21T08:09:41Z","timestamp":1458547781000},"page":"290-305","source":"Crossref","is-referenced-by-count":2,"title":["Stabbing Circles for Sets of Segments in the Plane"],"prefix":"10.1007","author":[{"given":"Merc\u00e8","family":"Claverol","sequence":"first","affiliation":[]},{"given":"Elena","family":"Khramtcova","sequence":"additional","affiliation":[]},{"given":"Evanthia","family":"Papadopoulou","sequence":"additional","affiliation":[]},{"given":"Maria","family":"Saumell","sequence":"additional","affiliation":[]},{"given":"Carlos","family":"Seara","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,22]]},"reference":[{"key":"22_CR1","unstructured":"Abellanas, M., Hurtado, F., Icking, C., Klein, R., Langetepe, E., Ma, L.,Palop, B., Sacrist\u00e1n, V.: The farthest color Voronoi diagram and related problems. In: 17th European Workshop on Computational Geometry, pp. 113\u2013116 (2001)"},{"issue":"2","key":"22_CR2","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/j.comgeo.2012.10.009","volume":"47","author":"EM Arkin","year":"2014","unstructured":"Arkin, E.M., Dieckmann, C., Knauer, C., Mitchell, J.S., Polishchuk, V., Schlipf, L., Yang, S.: Convex transversals. Comput. Geom. 47(2), 224\u2013239 (2014)","journal-title":"Comput. Geom."},{"key":"22_CR3","doi-asserted-by":"publisher","DOI":"10.1142\/8685","volume-title":"Voronoi Diagrams and Delaunay Triangulations","author":"F Aurenhammer","year":"2013","unstructured":"Aurenhammer, F., Klein, R., Lee, D.T.: Voronoi Diagrams and Delaunay Triangulations. World Scientific, Singapore (2013)"},{"issue":"2","key":"22_CR4","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0020-0190(89)90155-5","volume":"33","author":"D Avis","year":"1989","unstructured":"Avis, D., Robert, J., Wenger, R.: Lower bounds for line stabbing. Inform. Process. Lett. 33(2), 59\u201362 (1989)","journal-title":"Inform. Process. Lett."},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-642-54423-1_9","volume-title":"LATIN 2014: Theoretical Informatics","author":"P Cheilaris","year":"2014","unstructured":"Cheilaris, P., Khramtcova, E., Langerman, S., Papadopoulou, E.: A randomized incremental approach for the Hausdorff Voronoi diagram of non-crossing clusters. In: Pardo, A., Viola, A. (eds.) LATIN 2014. LNCS, vol. 8392, pp. 96\u2013107. Springer, Heidelberg (2014)"},{"issue":"4","key":"22_CR6","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.comgeo.2010.11.004","volume":"44","author":"O Cheong","year":"2011","unstructured":"Cheong, O., Everett, H., Glisse, M., Gudmundsson, J., Hornus, S., Lazard, S., Lee, M., Na, H.: Farthest-polygon Voronoi diagrams. Comput. Geom. 44(4), 234\u2013247 (2011)","journal-title":"Comput. Geom."},{"key":"22_CR7","unstructured":"Claverol, M.: Problemas geom\u00e9tricos en morfolog\u00eda computacional. Ph.D. thesis, Universitat Polit\u00e8cnica de Catalunya (2004)"},{"issue":"5","key":"22_CR8","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.comgeo.2010.12.004","volume":"44","author":"M Claverol","year":"2011","unstructured":"Claverol, M., Garijo, D., Grima, C.I., M\u00e1rquez, A., Seara, C.: Stabbers of line segments in the plane. Comput. Geom. 44(5), 303\u2013318 (2011)","journal-title":"Comput. Geom."},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-319-22177-9_5","volume-title":"Fundamentals of Computation Theory","author":"M Claverol","year":"2015","unstructured":"Claverol, M., Garijo, D., Korman, M., Seara, C., Silveira, R.I.: Stabbing segments with rectilinear objects. In: Kosowski, A., Walukiewicz, I. (eds.) FCT 2015. LNCS, vol. 9210, pp. 53\u201364. Springer, Heidelberg (2015)"},{"issue":"1","key":"22_CR10","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.comgeo.2014.06.002","volume":"48","author":"JM D\u00edaz-B\u00e1\u00f1ez","year":"2015","unstructured":"D\u00edaz-B\u00e1\u00f1ez, J.M., Korman, M., P\u00e9rez-Lantero, P., Pilz, A., Seara, C., Silveira, R.I.: New results on stabbing segments with a polygon. Comput. Geom. 48(1), 14\u201329 (2015)","journal-title":"Comput. Geom."},{"issue":"3","key":"22_CR11","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/BF01934440","volume":"22","author":"H Edelsbrunner","year":"1982","unstructured":"Edelsbrunner, H., Maurer, H., Preparata, F., Rosenberg, A., Welzl, E., Wood, D.: Stabbing line segments. BIT 22(3), 274\u2013281 (1982)","journal-title":"BIT"},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/BF02187733","volume":"4","author":"H Edelsbrunner","year":"1989","unstructured":"Edelsbrunner, H., Guibas, L.J., Sharir, M.: The upper envelope of piecewise linear functions: algorithms and applications. Discrete Comput. Geom. 4, 311\u2013336 (1989)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"22_CR13","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1137\/0215023","volume":"15","author":"H Edelsbrunner","year":"1986","unstructured":"Edelsbrunner, H., Guibas, L.J., Stolfi, J.: Optimal point location in a monotone subdivision. SIAM J. Comput. 15(2), 317\u2013340 (1986)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"22_CR14","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BF02189323","volume":"9","author":"DP Huttenlocher","year":"1993","unstructured":"Huttenlocher, D.P., Kedem, K., Sharir, M.: The upper envelope of Voronoi surfaces and its applications. Discrete Comput. Geom. 9(1), 267\u2013291 (1993)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"22_CR15","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1137\/0212002","volume":"12","author":"D Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, D.: Optimal search in planar subdivisions. SIAM J. Comput. 12(1), 28\u201335 (1983)","journal-title":"SIAM J. Comput."},{"key":"22_CR16","series-title":"Lecture Notes in ComputerScience","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-52055-4","volume-title":"Concrete and Abstract Voronoi Diagrams","author":"R Klein","year":"1989","unstructured":"Klein, R.: Concrete and Abstract Voronoi Diagrams. LNCS, vol. 400. Springer, Heidelberg (1989)"},{"issue":"6","key":"22_CR17","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1142\/S0218195904001536","volume":"14","author":"E Papadopoulou","year":"2004","unstructured":"Papadopoulou, E., Lee, D.T.: The Hausdorff Voronoi diagram of polygonal objects: a divide and conquer approach. Int. J. Comput. Geom. Appl. 14(6), 421\u2013452 (2004)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"2","key":"22_CR18","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s00453-004-1095-0","volume":"40","author":"E Papadopoulou","year":"2004","unstructured":"Papadopoulou, E.: The Hausdorff Voronoi diagram of point clusters in the plane. Algorithmica 40(2), 63\u201382 (2004)","journal-title":"Algorithmica"},{"issue":"3","key":"22_CR19","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1142\/S0218195995000143","volume":"5","author":"D Rappaport","year":"1995","unstructured":"Rappaport, D.: Minimum polygon transversals of line segments. Int. J. Comput. Geom. Appl. 5(3), 243\u2013256 (1995)","journal-title":"Int. J. Comput. Geom. Appl."}],"container-title":["Lecture Notes in Computer Science","LATIN 2016: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49529-2_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T20:19:26Z","timestamp":1559420366000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49529-2_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662495285","9783662495292"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49529-2_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}