• 한국CDE학회논문집
• /
• 제11권1호
• /
• pp.1-10
• /
• 2006

This paper addresses B-spline curve approximation of a set of ordered points to a specified toterance. The important issue in this problem is to reduce the number of control points while keeping the desired accuracy in the resulting B-spline curve. In this paper we propose a new method for error-bounded B-spline curve approximation based on adaptive selection of dominant points. The method first selects from the given points initial dominant points that govern the overall shape of the point set. It then computes a knot vector using the dominant points and performs B-spline curve fitting to all the given points. If the fitted B-spline curve cannot approximate the points within the tolerance, the method selects more points as dominant points and repeats the curve fitting process. The knots are determined in each step by averaging the parameters of the dominant points. The resulting curve is a piecewise B-spline curve of order (degree+1) p with $C^{(p-2)}$ continuity at each knot. The shape index of a point set is introduced to facilitate the dominant point selection during the iterative curve fitting process. Compared with previous methods for error-bounded B-spline curve approximation, the proposed method requires much less control points to approximate the given point set with the desired shape fidelity. Some experimental results demonstrate its usefulness and quality.

• 한국CDE학회논문집
• /
• 제4권1호
• /
• pp.32-42
• /
• 1999

Approximate lofting or skinning is one of practical surface modeling techniques well used in CAD and reverse engineering applications. Presented in this paper is a method for approximately lofting a given set of curves wihin a specified tolereance. It is based on refitting input curves simultaneously on a common knot vector and interpolating them to get a resultant NURBS surface. A concept of reducing the number of interior knots of the common knot vector is well adopted to acquire more compact representation for the resultant surface. Energy minimization is newly introduced in curve refitting process to stabilize the solution of the fitting problem and get more fair curve. The proposed approximate lofting provides more smooth surface models and realizes more efficient data reduction expecially when the parameterization and compatibility of input curves are not good enough. The method has been successfully implemented in a new CAD/CAM product VX Vision? of Varimetrix Corporation.

• Journal of Computational Design and Engineering
• /
• 제2권1호
• /
• pp.1-15
• /
• 2015

Measured bidirectional reflectance distribution function (BRDF) data have been used to represent complex interaction between lights and surface materials for photorealistic rendering. However, their massive size makes it hard to adopt them in practical rendering applications. In this paper, we propose an adaptive method for B-spline volume representation of measured BRDF data. It basically performs approximate B-spline volume lofting, which decomposes the problem into three sub-problems of multiple B-spline curve fitting along u-, v-, and w-parametric directions. Especially, it makes the efficient use of knots in the multiple B-spline curve fitting and thereby accomplishes adaptive knot placement along each parametric direction of a resulting B-spline volume. The proposed method is quite useful to realize efficient data reduction while smoothing out the noises and keeping the overall features of BRDF data well. By applying the B-spline volume models of real materials for rendering, we show that the B-spline volume models are effective in preserving the features of material appearance and are suitable for representing BRDF data.

• Journal of Computational Design and Engineering
• /
• 제3권1호
• /
• pp.14-23
• /
• 2016

The problem of fitting B-spline curves to planar point clouds is studied in this paper. A novel method is proposed to deal with the most challenging case where multiple intersecting curves or curves with self-intersection are necessary for shape representation. A method based on Delauney Triangulation of data points is developed to identify connected components which is also capable of removing outliers. A skeleton representation is utilized to represent the topological structure which is further used to create a weighted graph for deciding the merging of curve segments. Different to existing approaches which utilize local shape information near intersections, our method considers shape characteristics of curve segments in a larger scope and is thus capable of giving more satisfactory results. By fitting each group of data points with a B-spline curve, we solve the problems of curve structure reconstruction from point clouds, as well as the vectorization of simple line drawing images by drawing lines reconstruction.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2003년도 추계학술대회
• /
• pp.1334-1339
• /
• 2003

An efficient method is developed for the shape optimization of 2-D structures. The sequential linear programming is used for minimization problems. Selected set of master nodes are employed as design variables and assigned to move towards the normal direction. After adapting the nodes on the design boundary, the B-spline curves and mesh smoothing schemes are used to maintain the finite element in good quality. Finally, a numerical implementation of optimum design of an automobile torque converter piston subjected to pressure and centrifugal loads is presented. The results shows additional weight up to 13% may be saved after the shape optimization.

• Journal of Ship and Ocean Technology
• /
• 제10권2호
• /
• pp.24-36
• /
• 2006

Ship hullform is usually designed with a curve network, and smooth hullform surfaces are supposed to be generated by filling in (or interpolating) the curve network with appropriate surface patches. Tensor-product surfaces such as B-spline and $B\'{e}zier$ patches are typical representations to this interpolating problem. However, they have difficulties in representing the surfaces of irregular topological type which are frequently appeared in the fore- and after-body of ship hullform curve network. In this paper, we proposed a method that can automatically generate discrete $G^1$ continuous B-spline surfaces interpolating given curve network of ship hullform. This method consists of three steps. In the first step, given curve network is reorganized to be of two types: boundary curves and reference curves of surface patches. Especially, the boundary curves are specified for their surface patches to be rectangular or triangular topological type that can be represented with tensor-product (or degenerate) B-spline surface patches. In the second step, surface fitting points and cross boundary derivatives are estimated by constructing virtual iso-parametric curves at discrete parameters. In the last step, discrete $G^1$ continuous B-spline surfaces are generated by surface fitting algorithm. Finally, several examples of resulting smooth hullform surfaces generated from the curve network data of actual ship hullform are included to demonstrate the quality of the proposed method.

• Journal of Computational Design and Engineering
• /
• 제2권4호
• /
• pp.218-232
• /
• 2015

Piecewise linear (G01-based) tool paths generated by CAM systems lack $G_1$ and $G_2$ continuity. The discontinuity causes vibration and unnecessary hesitation during machining. To ensure efficient high-speed machining, a method to improve the continuity of the tool paths is required, such as B-spline fitting that approximates G01 paths with B-spline curves. Conventional B-spline fitting approaches cannot be directly used for tool path B-spline fitting, because they have shortages such as numerical instability, lack of chord error constraint, and lack of assurance of a usable result. Progressive and Iterative Approximation for Least Squares (LSPIA) is an efficient method for data fitting that solves the numerical instability problem. However, it does not consider chord errors and needs more work to ensure ironclad results for commercial applications. In this paper, we use LSPIA method incorporating Energy term (ELSPIA) to avoid the numerical instability, and lower chord errors by using stretching energy term. We implement several algorithm improvements, including (1) an improved technique for initial control point determination over Dominant Point Method, (2) an algorithm that updates foot point parameters as needed, (3) analysis of the degrees of freedom of control points to insert new control points only when needed, (4) chord error refinement using a similar ELSPIA method with the above enhancements. The proposed approach can generate a shape-preserving B-spline curve. Experiments with data analysis and machining tests are presented for verification of quality and efficiency. Comparisons with other known solutions are included to evaluate the worthiness of the proposed solution.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1988년도 전기.전자공학 학술대회 논문집
• /
• pp.679-682
• /
• 1988

From the viewpoint of general recognition system, B-spline is introduced for the approximation and recognition of human profile contours. Profile contour is approximated to the cublic B-spline curve by least square fitting so that B-Spline nodes nearly correspond with the curvature extrema of the contour. This method is designed for the spline to be good features in recognition, and also showed good approximation compared with the variants of B-spline appraximation.

• 대한전자공학회논문지SP
• /
• 제41권4호
• /
• pp.51-61
• /
• 2004

치과 분야에서 치아가 개별적으로 조작될 수 있는 3차원 치아 모델은 치과 치료와 시술 시뮬레이션을 위해 중요한 요소이다. CT영상으로부터 이러한 치아 모델을 재구성하기 위해서는 각 치아의 경계를 정확하게 분할할 수 있어야 한다. 그러나 기존의 3차원 재구성 시스템에서 사용되는 임계화 방법은 치아들과 치아와 비슷한 밝기의 치조골이 서로 인접해서 나타나는 CT 영상열에서 효율적이지 못하다. 본 논문에서는 CT영상에서 부드러운 치아 경계를 추출하기 위해 B-spline 곡선 적합을 이용한 치아 분할 방법을 제안한다. 성공적인 적합을 위해서 이전 슬라이스의 분할정보와 적응 최적 임계화 방법을 기반으로 한 초기경계 생성방법을 제안한다. 그리고 적합과정에서 이웃한 유사한 물체에 적합되는 것을 줄일 수 있는 유전자 알고리즘을 이용한 B-spline 적합방법을 제안한다. 평가결과 제안된 알고리즘은 개별치아의 경계를 성공적으로 검출하였으며 이를 이용하여 시술과 치료 과정의 시뮬레이션을 위한 치아의 3차원 모델을 정확하고 부드럽게 생성할 수 있음을 보였다.

• International Journal of CAD/CAM
• /
• 제12권1호
• /
• pp.9-19
• /
• 2012

Generation of optimum planar B-spline curve in terms of minimum deviation and required fairness to approximate a target shape defined by a strip-shaped unorganized 2D point cloud is studied. It is proposed to use the location of control points as variables within the geometric optimization framework of point distance minimization. An adaptive simulated annealing heuristic optimization algorithm is developed to iteratively update an initial approximate curve towards the target shape. The new implementation comprises an adaptive cooling procedure in which the temperature change is adaptively dependent on the objective function evolution. It is shown that the proposed method results in an improved convergence speed when compared to the standard simulated annealing method. A couple of examples are included to show the applicability of the proposed method in the surface model reconstruction directly from point cloud data.