Full Text:
<2364>
CLC number: TP391.72
On-line Access: 2024-08-27
Received: 2023-10-17
Revision Accepted: 2024-05-08
Crosschecked: 0000-00-00
Cited: 0
Clicked: 4621
Optimal multi-degree reduction of Bézier curves with G1-continuity
| |||||||||||||
Lu Li-Zheng, Wang Guo-Zhao. Optimal multi-degree reduction of Bézier curves with G1-continuity[J]. Journal of Zhejiang University Science A, 2006, 7(101): 174-180.
@article{title="Optimal multi-degree reduction of Bézier curves with G1-continuity",
author="Lu Li-Zheng, Wang Guo-Zhao",
journal="Journal of Zhejiang University Science A",
volume="7",
number="101",
pages="174-180",
year="2006",
publisher="Zhejiang University Press & Springer",
doi="10.1631/jzus.2006.AS0174"
}
%0 Journal Article
%T Optimal multi-degree reduction of Bézier curves with G1-continuity
%A Lu Li-Zheng
%A Wang Guo-Zhao
%J Journal of Zhejiang University SCIENCE A
%V 7
%N 101
%P 174-180
%@ 1673-565X
%D 2006
%I Zhejiang University Press & Springer
%DOI 10.1631/jzus.2006.AS0174
TY - JOUR
T1 - Optimal multi-degree reduction of Bézier curves with G1-continuity
A1 - Lu Li-Zheng
A1 - Wang Guo-Zhao
J0 - Journal of Zhejiang University Science A
VL - 7
IS - 101
SP - 174
EP - 180
%@ 1673-565X
Y1 - 2006
PB - Zhejiang University Press & Springer
ER -
DOI - 10.1631/jzus.2006.AS0174
Abstract: This paper presents a novel approach to consider optimal multi-degree reduction of bé;zier curve with G1-continuity. By minimizing the distances between corresponding control points of the two curves through degree raising, optimal approximation is achieved. In contrast to traditional methods, which typically consider the components of the curve separately, we use geometric information on the curve to generate the degree reduction. So positions and tangents are preserved at the two endpoints. For satisfying the solvability condition, we propose another improved algorithm based on regularization terms. Finally, numerical examples demonstrate the effectiveness of our algorithms.
[1] Ahn, Y.J., 2003. Degree reduction of Bézier curves with Ck-continuity using Jacobi polynomials. Computer Aided Geometric Design, 20(7):423-434.
[2] Ahn, Y.J., Lee, B.G., Park, Y., Yoo, J., 2004. Constrained polynomial degree reduction in the L2-norm equals best weighted Euclidean approximation of Bézier coefficients. Computer Aided Geometric Design, 21(2):181-191.
[3] Chen, G.D., Wang, G.J., 2002. Optimal multi-degree reduction of Bézier curves with constraints of endpoints continuity. Computer Aided Geometric Design, 19(6):365-377.
[4] de Boor, C., Höllig, K., Sabin, M., 1987. High accuracy geometric Hermite interpolation. Computer Aided Geometric Design, 4(4):269-278.
[5] Degen, W.L.F., 2005. Geometric Hermite Interpolation—In memoriam Josef Hoschek. Computer Aided Geometric Design, 22(7):573-592.
[6] Eck, M., 1995. Least squares degree reduction of Bézier curves. Computer-Aided Design, 27(11):845-851.
[7] Farin, G., 1983. Algorithms for rational Bézier curves. Computer-Aided Design, 15(2):73-79.
[8] Farin, G., 2001. Curves and Surfaces for CAGD (5th Ed.). Morgan Kaufmann, San Francisco, p.81-93.
[9] Fleishman, S., Drori, I., Cohen-Or, D., 2003. Bilateral mesh denoising. ACM Trans. on Graphics, 22(3):950-953.
[10] Forrest, A.R., 1972. Interactive interpolation and approximation by Bézier curve. The Computer Journal, 15(1):71-79.
[11] Hu, S.M., Sun, J.G., Jin, T.G., Wang, G.Z., 1998. Approximate degree reduction of Bézier curves. Tsinghua Science and Technology, 3(2):997-1000.
[12] Hu, S.M., Tong, R.F., Ju, T., Sun, J.G., 2001. Approximate merging of a pair of Bézier curves. Computer-Aided Design, 33(2):125-136.
[13] Szegö, G., 1975. Orthogonal Polynomials (4th Ed.). American Mathematical Society, Providence, RI, p.22-106.
[14] Watkins, M.A., Worsey, A.J., 1988. Degree reduction of Bézier curves. Computer-Aided Design, 20(7):398-405.
Open peer comments: Debate/Discuss/Question/Opinion
<1>