{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T03:51:26Z","timestamp":1794369086688,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642106309","type":"print"},{"value":"9783642106316","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10631-6_87","type":"book-chapter","created":{"date-parts":[[2009,12,4]],"date-time":"2009-12-04T02:03:43Z","timestamp":1259892223000},"page":"862-871","source":"Crossref","is-referenced-by-count":3,"title":["Reconstructing Polygons from Scanner Data"],"prefix":"10.1007","author":[{"given":"Therese","family":"Biedl","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stephane","family":"Durocher","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jack","family":"Snoeyink","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"2\u20133","key":"87_CR1","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/S0925-7721(01)00017-7","volume":"19","author":"N. Amenda","year":"2001","unstructured":"Amenda, N., Choi, S., Kolluri, R.: The power crust, union of balls and the medial axis. Comp. Geom.: Theory & App.\u00a019(2\u20133), 127\u2013153 (2001)","journal-title":"Comp. Geom.: Theory & App."},{"key":"87_CR2","doi-asserted-by":"crossref","unstructured":"Amenta, N., Choi, S., Kolluri, R.: The power crust. In: Proc. ACM Symp. Solid Model. & App., pp. 249\u2013260 (2001)","DOI":"10.1145\/376957.376986"},{"key":"87_CR3","unstructured":"DeltaSphere, Inc. Deltasphere 3D laser scanner (2001), http:\/\/www.deltasphere.com\/DeltaSphere-3000.html"},{"key":"87_CR4","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, trees, and flowers. Can. J. Math.\u00a017, 449\u2013467 (1965)","journal-title":"Can. J. Math."},{"key":"87_CR5","first-page":"225","volume":"40","author":"M. Formann","year":"1990","unstructured":"Formann, M., Woeginger, G.J.: On the reconstruction of simple polygons. Bull. Eur. Assoc. Theor. Comp. Sc.\u00a040, 225\u2013230 (1990)","journal-title":"Bull. Eur. Assoc. Theor. Comp. Sc."},{"key":"87_CR6","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. W.H. Freeman, New York (1979)"},{"issue":"4","key":"87_CR7","first-page":"472","volume":"1","author":"J.E. Hopcroft","year":"1988","unstructured":"Hopcroft, J.E., Karp, R.M.: An n5\/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comp.\u00a01(4), 472\u2013484 (1988)","journal-title":"SIAM J. Comp."},{"issue":"4","key":"87_CR8","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1137\/0211056","volume":"11","author":"A. Itai","year":"1982","unstructured":"Itai, A., Papadimitriou, C.H., Szwarcfiter, J.L.: Hamilton paths in grid graphs. SIAM J. Comp.\u00a011(4), 676\u2013686 (1982)","journal-title":"SIAM J. Comp."},{"issue":"4","key":"87_CR9","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/BF01990536","volume":"33","author":"K. Jansen","year":"1993","unstructured":"Jansen, K., Woeginger, G.J.: The complexity of detecting crossingfree configurations in the plane. BIT\u00a033(4), 580\u2013595 (1993)","journal-title":"BIT"},{"key":"87_CR10","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching theory. In: Ann. Disc. Math. North-Holland Mathematics Studies, vol.\u00a029 (1986)"},{"key":"87_CR11","doi-asserted-by":"crossref","unstructured":"Nyland, L., Lastra, A., McAllister, D., Popescu, V., McCue, C.: Capturing, processing and rendering real-world scenes. In: El-Hakim, S.F., Gruen, A. (eds.) Videometrics and Optical Methods for 3D Shape Measurement, Electronic Imaging. SPIE Int. Soc. Optical. Eng. (2001)","DOI":"10.1117\/12.410894"},{"key":"87_CR12","first-page":"97","volume-title":"Computational Morphology","author":"J. O\u2019Rourke","year":"1988","unstructured":"O\u2019Rourke, J.: Uniqueness of orthogonal connect-the-dots. In: Toussaint, G.T. (ed.) Computational Morphology, pp. 97\u2013104. Elsevier, Amsterdam (1988)"},{"key":"87_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"F. Preparata","year":"1985","unstructured":"Preparata, F., Shamos, M.: Computational Geometry: An Introduction. Springer, Heidelberg (1985)"},{"key":"87_CR14","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)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10631-6_87.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:32:27Z","timestamp":1606167147000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10631-6_87"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642106309","9783642106316"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10631-6_87","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-642-10631-6","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}