{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:51:13Z","timestamp":1725490273486},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744689"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74472-6_4","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T16:31:01Z","timestamp":1188318661000},"page":"41-54","source":"Crossref","is-referenced-by-count":2,"title":["On Intersecting a Set of Isothetic Line Segments with a Convex Polygon of Minimum Area"],"prefix":"10.1007","author":[{"given":"Asish","family":"Mukhopadhyay","sequence":"first","affiliation":[]},{"given":"Eugene","family":"Greene","sequence":"additional","affiliation":[]},{"given":"S. V.","family":"Rao","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/BF01934440","volume":"22","author":"H. Edelsbrunner","year":"1982","unstructured":"Edelsbrunner, H., Maurer, H.A., Preparata, F.P., Rosenberg, A.L., Welzl, E., Wood, D.: Stabbing line segments. BIT\u00a022, 274\u2013281 (1982)","journal-title":"BIT"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/0734-189X(90)90135-I","volume":"49","author":"M. Goodrich","year":"1990","unstructured":"Goodrich, M., Snoeyink, J.: Stabbing parallel segments with a convex polygon. Computer vision, Graphics and Image Processing\u00a049, 152\u2013170 (1990)","journal-title":"Computer vision, Graphics and Image Processing"},{"unstructured":"Lyons, K.A., Meijer, H., Rappaport, D.: Minimum polygon stabbers of isothetic line segments. Department of Computing and Information Science, Queen\u2019s University, Ontario, Canada","key":"4_CR3"},{"doi-asserted-by":"crossref","unstructured":"Loffler, M., van Kreveld, M.: Largest and smallest convex hulls for imprecise points. Technical Report UU-CS-2006-019, Institute of Information and Computing Sciences, Utrecht University (2006)","key":"4_CR4","DOI":"10.1007\/11785293_35"},{"unstructured":"Mukhopadhyay, A., Kumar, C., Bhattacharya, B.: Computing an area-optimal convex polygonal stabber of a set of parallel line segments. In: Proceedings of the 5th Canadian Conference on Computational Geometry, pp. 169\u2013174 (1993)","key":"4_CR5"},{"unstructured":"Mukhopadhyay, A.: On intersecting a set of isothetic line segments with a convex polygon of minimum area. Technical Report 06-010, School of Computer Science, University of Windsor (2006)","key":"4_CR6"},{"doi-asserted-by":"crossref","unstructured":"O\u2019Rourke: Computational geometry column #3. SIGGRAPHB: Computer Graphics (SIGGRAPH)\u00a021 (1987)","key":"4_CR7","DOI":"10.1145\/37534.990014"},{"issue":"3","key":"4_CR8","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. International Journal of Computational Geometry & Applications\u00a05(3), 243\u2013256 (1995)","journal-title":"International Journal of Computational Geometry & Applications"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74472-6_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:31:35Z","timestamp":1619519495000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74472-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744689"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74472-6_4","relation":{},"subject":[]}}