---
res:
bibo_abstract:
- 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.@eng
bibo_authorlist:
- foaf_Person:
foaf_givenName: Eric
foaf_name: Berberich, Eric
foaf_surname: Berberich
- foaf_Person:
foaf_givenName: Dan
foaf_name: Halperin, Dan
foaf_surname: Halperin
- foaf_Person:
foaf_givenName: Michael
foaf_name: Kerber, Michael
foaf_surname: Kerber
foaf_workInfoHomepage: http://www.librecat.org/personId=36E4574A-F248-11E8-B48F-1D18A9856A87
orcid: 0000-0002-8030-9299
- foaf_Person:
foaf_givenName: Roza
foaf_name: Pogalnikova, Roza
foaf_surname: Pogalnikova
dct_date: 2010^xs_gYear
dct_language: eng
dct_publisher: TU Dortmund@
dct_title: Polygonal reconstruction from approximate offsets@
...