6 search results - page 2 / 2 » On the exact maximum complexity of Minkowski sums of convex ... |
COMPGEOM
2011
ACM
12 years 8 months ago
2011
ACM
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...