{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:57:46Z","timestamp":1725537466481},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642041273"},{"type":"electronic","value":"9783642041280"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04128-0_5","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T14:16:36Z","timestamp":1252937796000},"page":"47-58","source":"Crossref","is-referenced-by-count":0,"title":["On Inducing Polygons and Related Problems"],"prefix":"10.1007","author":[{"given":"Eyal","family":"Ackerman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rom","family":"Pinchasi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ludmila","family":"Scharf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Scherfenberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1142\/S0218195903001281","volume":"13","author":"P. Bose","year":"2003","unstructured":"Bose, P., Everett, H., Wismath, S.: Properties of arrangement graphs. Int. J. Comput. Geom. Appl.\u00a013, 447\u2013462 (2003)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"5_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry","author":"M. Berg de","year":"2008","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry, 3rd edn. Springer, Berlin (2008)","edition":"3"},{"issue":"3\u20134","key":"5_CR3","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0031-3203(85)90050-0","volume":"18","author":"Y.T. Ching","year":"1985","unstructured":"Ching, Y.T., Lee, D.T.: Finding the diameter of a set of lines. Pattern Recognition\u00a018(3\u20134), 249\u2013255 (1985)","journal-title":"Pattern Recognition"},{"key":"5_CR4","series-title":"Advanced Lectures in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-322-80303-0","volume-title":"Geometric Graphs and Arrangements. Some Chapters from Combinatorial Geometry","author":"S. Felsner","year":"2004","unstructured":"Felsner, S.: Geometric Graphs and Arrangements. Some Chapters from Combinatorial Geometry. Advanced Lectures in Mathematics. Friedr. Vieweg & Sohn, Wiesbaden (2004)"},{"key":"5_CR5","volume-title":"Conference Board of the Mathematical Sciences Regional Conference Series in Mathematics","author":"B. Gr\u00fcnbaum","year":"1972","unstructured":"Gr\u00fcnbaum, B.: Arrangements and spreads. In: Conference Board of the Mathematical Sciences Regional Conference Series in Mathematics, vol.\u00a010. American Mathematical Society, Providence (1972)"},{"issue":"2","key":"5_CR6","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01994880","volume":"32","author":"J. Hershberger","year":"1992","unstructured":"Hershberger, J., Suri, S.: Applications of a semi-dynamic convex hull algorithm. BIT\u00a032(2), 249\u2013267 (1992)","journal-title":"BIT"},{"key":"5_CR7","unstructured":"Perlstein, A.: Problems in Combinatorial Geometry, Ph.D. Thesis, Mathematics Department, Technion\u2014Israel Institute of Technology (2008)"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-540-92182-0_46","volume-title":"Algorithms and Computation","author":"L. Scharf","year":"2008","unstructured":"Scharf, L., Scherfenberg, M.: Inducing polygons of line arrangements. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol.\u00a05369, pp. 507\u2013519. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04128-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T14:38:56Z","timestamp":1552142336000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04128-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041273","9783642041280"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04128-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}