Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

COMPGEOM

2011

ACM

2011

ACM

We consider the oﬀset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorﬀ distance, as the Minkowski sum of another polygonal shape P with a disk of ﬁxed radius? If it does, we also seek a preferably simple-looking solution shape P; then, P’s oﬀset constitutes an accurate, vertexreduced, and smoothened approximation of Q. We give an O(n log n)-time exact decision algorithm that handles any polygonal shape, assuming the real-RAM model of computation. An alternative algorithm, based purely on rational arithmetic, answers the same deconstruction problem, up to an uncertainty parameter δ, and its running time depends on the parameter δ (in addition to the other input parameters: n, ε and the radius of the disk). If the input shape is found to be approximable, the rational-arithmetic algorithm also computes an approximate solution shape for the problem. For convex shapes, the complexity of the exact decision ...

Related Content

Added |
25 Aug 2011 |

Updated |
25 Aug 2011 |

Type |
Journal |

Year |
2011 |

Where |
COMPGEOM |

Authors |
Eric Berberich, Dan Halperin, Michael Kerber, Roza Pogalnikova |

Comments (0)