• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제13권4호
• /
• pp.257-265
• /
• 2009

In this paper we find an explicit form of upper bound of Hausdorff distance between given cubic spline curve and its quadratic spline approximation. As an application the approximation of offset curve of cubic spline curve is presented using our explicit error analysis. The offset curve of quadratic spline curve is exact rational spline curve of degree six, which is also an approximation of the offset curve of cubic spline curve.

• 한국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.

• 통합자연과학논문집
• /
• 제7권2호
• /
• pp.124-129
• /
• 2014

In this paper, we construct an logarithmic spiral-like curve using curvature-continuous quadratic spline and quadratic rational spline. The quadratic (rational) spline has self-similarity. We present some properties of the quadratic spline. Also using this $G^2$ quadratic spline, an approximation of logarithmic spiral is proposed and error analysis is obtained.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2004년도 학술대회 논문집 정보 및 제어부문
• /
• pp.169-171
• /
• 2004

This paper propose a new detection method of curve lane using Catmull-Rom spline for recognition various shape of the curve lane. To improve the accracy of lane detection, binarization and thinning process are firstly performed on the input image. Next, features on the curve lane such as curvature and orientation are extracted, and the control points of Catmull-Rom spline are detected to recognize the curve lane. Finally, Computer simulation results are given using a natural test image to show the efficiency of the proposed scheme.

• 제어로봇시스템학회논문지
• /
• 제20권2호
• /
• pp.138-142
• /
• 2014

This research presents an A* based algorithm which can be applied to Unmanned Ground Vehicle self-navigation in order to make the driving path smoother. Based on the grid map, A* algorithm generated the path by using straight lines. However, in this situation, the knee points, which are the connection points when vehicle changed orientation, are created. These points make Unmanned Ground Vehicle continuous navigation unsuitable. Therefore, in this paper, B-spline curve function is applied to transform the path transfer into curve type. And because the location of the control point has influenced the B-spline curve, the optimal control selection algorithm is proposed. Also, the optimal path tracking speed can be calculated through the curvature radius of the B-spline curve. Finally, based on this algorithm, a path created program is applied to the path results of the A* algorithm and this B-spline curve algorithm. After that, the final path results are compared through the simulation.

• Journal of Advanced Marine Engineering and Technology
• /
• 제21권4호
• /
• pp.381-386
• /
• 1997

The offsetting method using geometric properties of B-spline control polygon is more faster than using of general normal vector in offset processing. But this method itself does not solve the prob¬lems of loop removal in normal offsetting. Generally the distance between neighborhood spans of B-spline control polygon is greater than the offset distance, the loops are occurred in offsetting. For generating of the more precision tool-path in NC machining, the loops of offset must be removed. In this paper, two methods for loop removal are introduced in offsetting of B-spline curve. One is using the intersection of B-spline control span which being occurred of the loop. The other is using two B-spline curve divisions divided from original B-spline curve or its offset curve. After the inter¬section point of loop was searched, the loop being removed to cusp. Also the method for filleting of cusp is inspected to more precision cutting. It is shown that the offsetting using B-spline control polygon is more effective in the sculptured surface machining.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 2003년도 춘계공동학술대회
• /
• pp.474-479
• /
• 2003

This paper addresses the problem of B-spline surface interpolation to serial contours, where the number of points varies from contour to contour. A traditional lofting approach creates a set of B-spline curves via B-spline curve interpolation to each contour, makes them compatible via degree elevation and knot insertion, and performs B-spline surface lofting to get a B-spline surface interpolating them. The approach tends to result in an astonishing number of control points in the resulting B-spline surface. This situation arises mainly from the inevitable process of progressively merging different knot vectors to make the B-spline curves compatible. This paper presents a new approach for avoiding this troublesome situation. The approach includes a novel process of getting a set of compatible B-spline curves from the given contours. The process is based on the universal parameterization [1,2] allowing the knots to be selected freely but leading to a more stable linear system for B-spline curve interpolation. Since the number of control points in each compatible B-spline curve is equal to the highest number of contour points, the proposed approach can realize efficient data reduction and provide a compact representation of a B-spline surface while keeping the desired surface shape. Some experimental results demonstrate its usefulness and quality.

• 대한기계학회논문집
• /
• 제19권5호
• /
• pp.1168-1175
• /
• 1995

The application of cubic spline is presented for basic curve (DRD motion) of cam motion. The purpose of this paper is to achieve better dynamic characteristics than general cam curves. A cubic spline is a piecewise function that is continuous in displacement, velocity and acceleration. The best cam curve is obtained by changing the weights of the object function. So the method can be used to any machine system case by case. For the proposed object function, the result has improved all characteristics such as velocity, acceleration and jerk compared with that of the modified sine curve.

• 한국CDE학회논문집
• /
• 제5권3호
• /
• pp.276-284
• /
• 2000

Usual practice of the transformation of a B-spline curve into a set of piecewise polynomial curves in a power form is done by either a knot refinement followed by basis conversions or applying a Taylor expansion on the B-spline curve for each knot span. Presented in this paper is a new algorithm, called a direct expansion algorithm, for the problem. The algorithm first locates the coefficients of all the linear terms that make up the basis functions in a knot span, and then the algorithm directly obtains the power form representation of basis functions by expanding the summation of products of appropriate linear terms. Then, a polynomial segment of a knot span can be easily obtained by the summation of products of the basis functions within the knot span with corresponding control points. Repeating this operation for each knot span, all of the polynomials of the B-spline curve can be transformed into a power form. The algorithm has been applied to both static and dynamic curves. It turns out that the proposed algorithm outperforms the existing algorithms for the conversion for both types of curves. Especially, the proposed algorithm shows significantly fast performance for the dynamic curves.

• 대한조선학회지
• /
• 제27권1호
• /
• pp.3-10
• /
• 1990

선체형상의 수치적 표현방법에는 선형을 구성하고 있는 일련의 곡선들을 이용하여 선형을 표현하는 curve approach와 선형을 직접 surface로 수식 처리하여 선형을 정의하는 surface approach가 있다. 본 논문에서는 2차원 곡선인 transverse section curve와 3차원 곡선인 longitudinal curve로 구성되는 곡선군들에 의해 형성되는 곡면요소를 수학적으로 처리하여 선체형상을 정의하는 curve approach방법에 대해 기술하였다. 형상 표면에 사용된 곡선 형태는 일반적인 parametric cubic spline을 보완한 modified cubic spline으로서 이 spline형태는 곡선 segment의 양 끝점에서의 접선 각도가 클 경우에도 아주 부드러운 곡률 분포를 얻을 수 있게 하기 때문에 선박 계산뿐만 아니라 유체동역학적 계산을 위한 선형 정의용으로 사용 가능할 정도의 정확성을 가진 기본 설계용 선형정의 결과를 얻을 수 있었다. 응용 예로서 SWATH 선형과 해양 조사선 선형을 표현한 결과를 보였으며, 본 선형 정의 방법을 선형 변환 기법과 연결하여 설계 요구 조건에 적합한 선형을 얻기 위한 선형 변환 예도 보였다.