Earlier Version

# Deconstructing approximate offsets

Berberich E, Halperin D, Kerber M, Pogalnikova R. 2011. Deconstructing approximate offsets. Proceedings of the twenty-seventh annual symposium on Computational geometry. SCG: Symposium on Computational Geometry, 187–196.

Download (ext.)

http://arxiv.org/abs/1109.2158
[Preprint]

*Conference Paper*|

*Published*|

*English*

**Scopus indexed**

Author

Berberich, Eric;
Halperin, Dan;
Kerber, Michael

^{ISTA}^{}; Pogalnikova, RozaDepartment

Abstract

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 of another polygonal shape P with a disk of fixed radius? If it does, we also seek a preferably simple-looking solution shape P; then, P's offset constitutes an accurate, vertex-reduced, 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 algorithm 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. Our study is motivated by applications from two different domains. However, since the offset operation has numerous uses, we anticipate that the reverse question that we study here will be still more broadly applicable. We present results obtained with our implementation of the rational-arithmetic algorithm.

Publishing Year

Date Published

2011-06-13

Proceedings Title

Proceedings of the twenty-seventh annual symposium on Computational geometry

Page

187 - 196

Conference

SCG: Symposium on Computational Geometry

Conference Location

Paris, France

Conference Date

2011-06-13 – 2011-06-15

IST-REx-ID

### Cite this

Berberich E, Halperin D, Kerber M, Pogalnikova R. Deconstructing approximate offsets. In:

*Proceedings of the Twenty-Seventh Annual Symposium on Computational Geometry*. ACM; 2011:187-196. doi:10.1145/1998196.1998225Berberich, E., Halperin, D., Kerber, M., & Pogalnikova, R. (2011). Deconstructing approximate offsets. In

*Proceedings of the twenty-seventh annual symposium on Computational geometry*(pp. 187–196). Paris, France: ACM. https://doi.org/10.1145/1998196.1998225Berberich, Eric, Dan Halperin, Michael Kerber, and Roza Pogalnikova. “Deconstructing Approximate Offsets.” In

*Proceedings of the Twenty-Seventh Annual Symposium on Computational Geometry*, 187–96. ACM, 2011. https://doi.org/10.1145/1998196.1998225.E. Berberich, D. Halperin, M. Kerber, and R. Pogalnikova, “Deconstructing approximate offsets,” in

*Proceedings of the twenty-seventh annual symposium on Computational geometry*, Paris, France, 2011, pp. 187–196.Berberich, Eric, et al. “Deconstructing Approximate Offsets.”

*Proceedings of the Twenty-Seventh Annual Symposium on Computational Geometry*, ACM, 2011, pp. 187–96, doi:10.1145/1998196.1998225.**All files available under the following license(s):**

**Copyright Statement:**

**This Item is protected by copyright and/or related rights.**[...]

**Link(s) to Main File(s)**

Access Level

Open Access