{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T16:11:01Z","timestamp":1746115861542,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642382321"},{"type":"electronic","value":"9783642382338"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38233-8_13","type":"book-chapter","created":{"date-parts":[[2013,5,15]],"date-time":"2013-05-15T12:57:16Z","timestamp":1368622636000},"page":"146-157","source":"Crossref","is-referenced-by-count":0,"title":["New Results on Stabbing Segments with a Polygon"],"prefix":"10.1007","author":[{"given":"Jos\u00e9 Miguel","family":"D\u00edaz-B\u00e1\u00f1ez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matias","family":"Korman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pablo","family":"P\u00e9rez-Lantero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Pilz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos","family":"Seara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rodrigo I.","family":"Silveira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-642-29344-3_3","volume-title":"LATIN 2012: Theoretical Informatics","author":"E.M. Arkin","year":"2012","unstructured":"Arkin, E.M., D\u00edaz-B\u00e1\u00f1ez, J.M., Hurtado, F., Kumar, P., Mitchell, J.S.B., Palop, B., P\u00e9rez-Lantero, P., Saumell, M., Silveira, R.I.: Bichromatic 2-center of pairs of points. In: Fern\u00e1ndez-Baca, D. (ed.) LATIN 2012. LNCS, vol.\u00a07256, pp. 25\u201336. Springer, Heidelberg (2012)"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Arkin, E.M., Dieckmann, C., Knauer, C., Mitchell, J.S., Polishchuk, V., Schlipf, L., Yang, S.: Convex transversals. Comput. Geom. (2012) (article in press)","DOI":"10.1007\/978-3-642-22300-6_5"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Bl\u00f6mer, J.: Computing sums of radicals in polynomial time. In: FOCS 1991, pp. 670\u2013677. IEEE Computer Society (1991)","DOI":"10.1109\/SFCS.1991.185434"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-17458-2_5","volume-title":"Combinatorial Optimization and Applications","author":"O. Daescu","year":"2010","unstructured":"Daescu, O., Ju, W., Luo, J.: NP-completeness of spreading colored points. In: Wu, W., Daescu, O. (eds.) COCOA 2010, Part I. LNCS, vol.\u00a06508, pp. 41\u201350. Springer, Heidelberg (2010)"},{"key":"13_CR5","doi-asserted-by":"crossref","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. CoRR abs\/1211.1490 (2012)","DOI":"10.1007\/978-3-642-38233-8_13"},{"issue":"3","key":"13_CR6","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1007\/s00453-011-9516-3","volume":"63","author":"A. Dumitrescu","year":"2012","unstructured":"Dumitrescu, A., Jiang, M.: Minimum-perimeter intersecting polygons. Algorithmica\u00a063(3), 602\u2013615 (2012)","journal-title":"Algorithmica"},{"issue":"2","key":"13_CR7","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/0734-189X(90)90135-I","volume":"49","author":"M.T. Goodrich","year":"1990","unstructured":"Goodrich, M.T., Snoeyink, J.: Stabbing parallel segments with a convex polygon. Computer Vision, Graphics, and Image Processing\u00a049(2), 152\u2013170 (1990)","journal-title":"Computer Vision, Graphics, and Image Processing"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-642-03367-4_32","volume-title":"Algorithms and Data Structures","author":"F. Hassanzadeh","year":"2009","unstructured":"Hassanzadeh, F., Rappaport, D.: Approximation algorithms for finding a minimum perimeter polygon intersecting a set of line segments. In: Dehne, F., Gavrilova, M., Sack, J.-R., T\u00f3th, C.D. (eds.) WADS 2009. LNCS, vol.\u00a05664, pp. 363\u2013374. Springer, Heidelberg (2009)"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0167-5060(08)70044-X","volume":"9","author":"G.T. Klincsek","year":"1980","unstructured":"Klincsek, G.T.: Minimal triangulations of polygonal domains. Ann. Discrete Math.\u00a09, 121\u2013123 (1980)","journal-title":"Ann. Discrete Math."},{"issue":"2","key":"13_CR10","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00453-008-9174-2","volume":"56","author":"M. L\u00f6ffler","year":"2010","unstructured":"L\u00f6ffler, M., van Kreveld, M.J.: Largest and smallest convex hulls for imprecise points. Algorithmica\u00a056(2), 235\u2013269 (2010)","journal-title":"Algorithmica"},{"issue":"4","key":"13_CR11","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1016\/j.comgeo.2009.03.007","volume":"43","author":"M. L\u00f6ffler","year":"2010","unstructured":"L\u00f6ffler, M., van Kreveld, M.J.: Largest bounding box, smallest diameter, and related problems on imprecise points. Comput. Geom.\u00a043(4), 419\u2013433 (2010)","journal-title":"Comput. Geom."},{"key":"13_CR12","unstructured":"Meijer, H., Rappaport, D.: Minimum polygon covers of parallel line segments. In: CCCG 1990, pp. 324\u2013327 (1990)"},{"issue":"2","key":"13_CR13","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.ipl.2007.08.029","volume":"105","author":"A. Mukhopadhyay","year":"2008","unstructured":"Mukhopadhyay, A., Kumar, C., Greene, E., Bhattacharya, B.K.: On intersecting a set of parallel line segments with a convex polygon of minimum area. Inf. Proc. Lett.\u00a0105(2), 58\u201364 (2008)","journal-title":"Inf. Proc. Lett."},{"issue":"3","key":"13_CR14","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. Geometry Appl.\u00a05(3), 243\u2013256 (1995)","journal-title":"Int. J. Comput. Geometry Appl."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38233-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T10:09:35Z","timestamp":1746007775000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38233-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642382321","9783642382338"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38233-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}