{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:46:38Z","timestamp":1725558398590},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642137303"},{"type":"electronic","value":"9783642137310"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13731-0_2","type":"book-chapter","created":{"date-parts":[[2010,6,10]],"date-time":"2010-06-10T11:00:50Z","timestamp":1276167650000},"page":"13-24","source":"Crossref","is-referenced-by-count":4,"title":["Reconstructing a Simple Polygon from Its Angles"],"prefix":"10.1007","author":[{"given":"Yann","family":"Disser","sequence":"first","affiliation":[]},{"given":"Mat\u00fa\u0161","family":"Mihal\u00e1k","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Widmayer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"862","DOI":"10.1007\/978-3-642-10631-6_87","volume-title":"Algorithms and Computation","author":"T. Biedl","year":"2009","unstructured":"Biedl, T., Durocher, S., Snoeyink, J.: Reconstructing polygons from scanner data. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.\u00a05878, pp. 862\u2013871. Springer, Heidelberg (2009)"},{"doi-asserted-by":"crossref","unstructured":"Bil\u00f2, D., Disser, Y., Mihal\u00e1k, M., Suri, S., Vicari, E., Widmayer, P.: Reconstructing visibility graphs with simple robots. In: Proceedings of the 16th International Colloquium on Structural Information and Communication Complexity, pp. 87\u201399 (2009)","key":"2_CR2","DOI":"10.1007\/978-3-642-11476-2_8"},{"doi-asserted-by":"crossref","unstructured":"Chalopin, J., Das, S., Disser, Y., Mihal\u00e1k, M., Widmayer, P.: How simple robots benefit from looking back. In: Proceedings of the 7th International Conference on Algorithms and Complexity (to appear)","key":"2_CR3","DOI":"10.1007\/978-3-642-13073-1_21"},{"key":"2_CR4","first-page":"225","volume":"40","author":"M. Formann","year":"1990","unstructured":"Formann, M., Woeginger, G.: On the reconstruction of simple polygons. Bulletin of the EATCS\u00a040, 225\u2013230 (1990)","journal-title":"Bulletin of the EATCS"},{"key":"2_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543340","volume-title":"Visibility Algorithms in the Plane","author":"S.K. Ghosh","year":"2007","unstructured":"Ghosh, S.K.: Visibility Algorithms in the Plane. Cambridge University Press, Cambridge (2007)"},{"unstructured":"Ghosh, S.K., Goswami, P.P.: Unsolved problems in visibility graph theory. In: Proceedings of the India-Taiwan Conference on Discrete Mathematics, pp. 44\u201354 (2009)","key":"2_CR6"},{"issue":"1","key":"2_CR7","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0925-7721(01)00068-2","volume":"23","author":"L. Jackson","year":"2002","unstructured":"Jackson, L., Wismath, K.: Orthogonal polygon reconstruction from stabbing information. Computational Geometry\u00a023(1), 69\u201383 (2002)","journal-title":"Computational Geometry"},{"issue":"4","key":"2_CR8","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/BF01990536","volume":"33","author":"K. Jansen","year":"1993","unstructured":"Jansen, K., Woeginger, G.: The complexity of detecting crossingfree configurations in the plane. BIT Numerical Mathematics\u00a033(4), 580\u2013595 (1993)","journal-title":"BIT Numerical Mathematics"},{"unstructured":"Kameda, T., Yamashita, M.: On the reconstruction of polygons with (simple) robots. Personal communication (2009)","key":"2_CR9"},{"unstructured":"Rappaport, D.: On the complexity of computing orthogonal polygons from a set of points. Technical Report SOCS-86.9, McGill University, Montr\u00e9al, Canada (1986)","key":"2_CR10"},{"unstructured":"Sidlesky, A., Barequet, G., Gotsman, C.: Polygon reconstruction from line cross-sections. In: Proceedings of the 18th Annual Canadian Conference on Computational Geometry, pp. 81\u201384 (2006)","key":"2_CR11"},{"doi-asserted-by":"crossref","unstructured":"Skiena, S., Smith, W., Lemke, P.: Reconstructing sets from interpoint distances. In: Proceedings of the Sixth Annual Symposium on Computational Geometry, pp. 332\u2013339 (1990)","key":"2_CR12","DOI":"10.1145\/98524.98598"},{"doi-asserted-by":"crossref","unstructured":"Snoeyink, J.: Cross-ratios and angles determine a polygon. In: Proceedings of the 14th Annual Symposium on Computational Geometry, pp. 49\u201357 (1998)","key":"2_CR13","DOI":"10.1145\/276884.276890"},{"issue":"9","key":"2_CR14","doi-asserted-by":"publisher","first-page":"1055","DOI":"10.1177\/0278364908095833","volume":"27","author":"S. Suri","year":"2008","unstructured":"Suri, S., Vicari, E., Widmayer, P.: Simple robots with minimal sensing: From local visibility to global geometry. International Journal of Robotics Research\u00a027(9), 1055\u20131067 (2008)","journal-title":"International Journal of Robotics Research"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory - SWAT 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13731-0_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:42:20Z","timestamp":1606185740000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13731-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642137303","9783642137310"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13731-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}