ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술지 Analytic and Discrete Fairing of Three-dimensional B-spline Curves using Nonlinear Programming
Cited 2 time in scopus Download 0 time Share share facebook twitter linkedin kakaostory
저자
이현찬, 홍석용, 홍충성, 박구현, 김덕수
발행일
200709
출처
Computers & Industrial Engineering, v.53 no.2, pp.263-269
ISSN
0360-8352
출판사
Elsevier
DOI
https://dx.doi.org/10.1016/j.cie.2007.06.019
협약과제
07MI1200, 능동형 서비스를 위한 URC 서버 프레임웍 개발, 조현규
초록
In reverse engineering, curves are constructed by interpolating the data points digitized from existing products. However, the constructed curves could have errors due to the noises in the digitized data points. If the errors remain, designers may get undesirable results. Thus, fairing of the curves is performed during computer modeling process. This paper presents two fairing algorithms for three-dimensional B-spline curves. One is an analytic fairing algorithm, and the other is a discrete fairing algorithm. These algorithms are based on automatic repositioning of the control points or the data points of a B-spline curve using a constrained nonlinear optimization algorithm. We analyzed the tradeoffs of the two fairing algorithms in terms of fairing flexibility and shape preservation. © 2007 Elsevier Ltd. All rights reserved.
KSP 제안 키워드
B-spline curve, B-spline curves, Constrained nonlinear optimization, Control Points, Modeling Process, Non-Linear Programming(NLP), Nonlinear optimization algorithm, Reverse Engineering, Shape preservation, Three dimensional(3D), computer modeling