Approximation of an open polygonal curve with a minimum number of circular arcs
作者： R. L. Scot , Astrid Sturm , DrysdaleGunter Rote
DOI:
关键词:
摘要: An algorithm for approximating a given open polygonal curve with minimum number of circular arcs is introduced. In computer-aided manufacturing environments the paths cutting tools are usually described and straight line segments. Greedy algorithms curves higher order can be found in literature. Without theoretical bounds it difficult to prove anything about quality these algorithms. We present an which allows us build directed graph all possible look shortest path from start point end curve. runtime O(n 2 logn), n vertices original chain.
eurocg.org 参考文章(7)
Martin Held, Johannes Eibl, Biarc approximation of polygons within asymmetric tolerance bands Computer-aided Design. ,vol. 37, pp. 357- 371 ,(2005) , 10.1016/J.CAD.2004.06.001
Millan K. Yeung, Desmond J. Walton, Curve fitting with arc splines for NC toolpath generation Computer-aided Design. ,vol. 26, pp. 845- 849 ,(1994) , 10.1016/0010-4485(94)90099-X
L. Piegl, Curve fitting algorithm for rough cutting Computer-Aided Design. ,vol. 18, pp. 79- 82 ,(1986) , 10.1016/0010-4485(86)90154-5
D.S. Meek, D.J. Walton, Approximating smooth planar curves by arc splines Journal of Computational and Applied Mathematics. ,vol. 59, pp. 221- 231 ,(1995) , 10.1016/0377-0427(94)00029-Z
J. Schönherr, Smooth biarc curves Computer-aided Design. ,vol. 25, pp. 365- 370 ,(1993) , 10.1016/0010-4485(93)90031-I
D.S. Meek, D.J. Walton, Approximating quadratic NURBS curves by arc splines Computer-aided Design. ,vol. 25, pp. 371- 376 ,(1993) , 10.1016/0010-4485(93)90032-J
D.S. Meek, D.J. Walton, Approximation of discrete data by G1 arc splines Computer-aided Design. ,vol. 24, pp. 301- 306 ,(1992) , 10.1016/0010-4485(92)90047-E