Abstract
We present a method for approximating an open polygonal curve by a smooth arc spline with respect to a user-specified maximum tolerance. Additionally, straight sections of the polygon are detected resulting in a finite set of pairwise disjoint line segments. The proposed algorithm guarantees that the resulting arc spline does not exceed the tolerance and that sections of the pre-computed lines are part of the solution. Subject to these conditions we obtain the minimally possible number of circular arcs and line segments. Note that in contrast to existing approaches, we do not restrict the breakpoints of the arc spline to original points but compute them automatically.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Maier, G.: Smooth Minimum Arc Paths. Contour Approximation with Smooth Arc Splines. Shaker, Aachen (2010)
Meek, D.S., Walton, D.J.: Approximating smooth planar curves by arc splines. Journal of Computational and Applied Mathematics 59, 221–231 (1995)
Park, H.: Optimal Single Biarc Fitting and its Applications. Computer Aided Design and Applications 1, 187–195 (2004)
Piegl, L.A., Tiller, W.: Data Approximation Using Biarcs. Eng. Comput (Lond.) 18, 59–65 (2002)
Yang, X.: Efficient circular arc interpolation based on active tolerance control. Computer-Aided Design 34, 1037–1046 (2002)
Heimlich, M., Held, M.: Biarc Approximation, Simplification and Smoothing of Polygonal Curves by Means of Voronoi-Based Tolerance Bands. Int. J. Comput. Geometry Appl. 18, 221–250 (2008)
Drysdale, R., Rote, G., Sturm, A.: Approximation of an open polyonal curve with a minimum number of circular ars and biarcs. Computational Geometry 41, 31–47 (2008)
Maier, G., Pisinger, G.: Approximation of a closed polygon with a minimum number of circular arcs and line segments. Computational Geometry 46, 263–275 (2013)
Ko-FAS, research initiative (2012), http://www.ko-fas.de
Maier, G., Janda, F., Schindler, A.: Minimum Description Length Arc Spline Approximation of Digital Curves. In: Proceedings of IEEE 19th International Conference on Image Processing (ICIP), pp. 1869–1872. IEEE (2012)
Guibas, L.J., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.E.: Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple Polygons. In: Symposium on Computational Geometry, pp. 1–13 (1986)
Chou, S.Y., Woo, T.C.: A linear-time algorithm for constructing a circular visibility diagram. Algorithmica 14, 203–228 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maier, G., Schindler, A., Janda, F., Brummer, S. (2013). Optimal Arc-Spline Approximation with Detecting Straight Sections. In: Murgante, B., et al. Computational Science and Its Applications – ICCSA 2013. ICCSA 2013. Lecture Notes in Computer Science, vol 7972. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39643-4_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-39643-4_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39642-7
Online ISBN: 978-3-642-39643-4
eBook Packages: Computer ScienceComputer Science (R0)