{"conference":{"location":"Dortmund, Germany","end_date":"2010-03-24","name":"EuroCG: European Workshop on Computational Geometry","start_date":"2010-03-22"},"title":"Polygonal reconstruction from approximate offsets","language":[{"iso":"eng"}],"department":[{"_id":"HeEd"}],"month":"01","publisher":"TU Dortmund","author":[{"full_name":"Berberich, Eric","last_name":"Berberich","first_name":"Eric"},{"first_name":"Dan","last_name":"Halperin","full_name":"Halperin, Dan"},{"first_name":"Michael","id":"36E4574A-F248-11E8-B48F-1D18A9856A87","full_name":"Kerber, Michael","orcid":"0000-0002-8030-9299","last_name":"Kerber"},{"last_name":"Pogalnikova","full_name":"Pogalnikova, Roza","first_name":"Roza"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","day":"01","_id":"3850","abstract":[{"lang":"eng","text":"Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum of another polygonal shape with a disk of fixed radius? If it does, we also seek a preferably simple solution shape P;P’s offset constitutes an accurate, vertex-reduced, and smoothened approximation of Q. We give a decision algorithm for fixed radius in O(nlogn) time that handles any polygonal shape. For convex shapes, the complexity drops to O(n), which is also the time required to compute a solution shape P with at most one more vertex than a vertex-minimal one."}],"date_created":"2018-12-11T12:05:30Z","page":"12 - 23","publist_id":"2334","type":"conference","citation":{"ieee":"E. Berberich, D. Halperin, M. Kerber, and R. Pogalnikova, “Polygonal reconstruction from approximate offsets,” presented at the EuroCG: European Workshop on Computational Geometry, Dortmund, Germany, 2010, pp. 12–23.","short":"E. Berberich, D. Halperin, M. Kerber, R. Pogalnikova, in:, TU Dortmund, 2010, pp. 12–23.","mla":"Berberich, Eric, et al. <i>Polygonal Reconstruction from Approximate Offsets</i>. TU Dortmund, 2010, pp. 12–23.","chicago":"Berberich, Eric, Dan Halperin, Michael Kerber, and Roza Pogalnikova. “Polygonal Reconstruction from Approximate Offsets,” 12–23. TU Dortmund, 2010.","ista":"Berberich E, Halperin D, Kerber M, Pogalnikova R. 2010. Polygonal reconstruction from approximate offsets. EuroCG: European Workshop on Computational Geometry, 12–23.","ama":"Berberich E, Halperin D, Kerber M, Pogalnikova R. Polygonal reconstruction from approximate offsets. In: TU Dortmund; 2010:12-23.","apa":"Berberich, E., Halperin, D., Kerber, M., &#38; Pogalnikova, R. (2010). Polygonal reconstruction from approximate offsets (pp. 12–23). Presented at the EuroCG: European Workshop on Computational Geometry, Dortmund, Germany: TU Dortmund."},"date_published":"2010-01-01T00:00:00Z","year":"2010","status":"public","oa_version":"None","publication_status":"published","date_updated":"2021-01-12T07:52:39Z"}