• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.159-169
• /
• 2005

An algorithmic approach to degree reduction of rational Bezier curves is presented. The algorithms are based on the degree reduction of polynomial Bezier curves. The method is introduced with the following steps: (a) convert the rational Bezier curve to polynomial Bezier curve by using homogenous coordinates, (b) reduce the degree of polynomial Bezier curve, (c) determine weights of degree reduced curve, (d) convert the Bezier curve obtained through step (b) to rational Bezier curve with weights in step (c).

• The KIPS Transactions:PartA
• /
• v.9A no.1
• /
• pp.99-104
• /
• 2002

The goal of this paper is to generalize the concept of Bezier curves and surfaces defined on the vector space $R_n$ to Lie groups, which is a new generation method of curves (called Bezier curves) on Lie groups. The defined Bezier curves and surfaces are alsways smooth because of the properties of Lie groups. We apply this method to smooth motion interpolation or smooth trajectory generation for moving rigid body in space.

• Korean Journal of Computational Design and Engineering
• /
• v.3 no.2
• /
• pp.135-139
• /
• 1998

The hodograph, which are usually defined as the derivative of parametric curve or surface, is useful far various geometric operations. It is known that the hodographs of Bezier curves and surfaces can be represented in the closed form. However, the counterparts of rational Bezier curves and surface have not been discussed yet. In this paper, the equations are derived, which are the closed form of rational Bezier curves and surfaces. The hodograph of rational Bezier curves of degree n can be represented in another rational Bezier curve of degree 2n. The hodograph of a rational Hazier surface of degree m×n with respect to a parameter can be also represented in rational Bezier surface of degree 2m×2n. The control points and corresponding weight of the hodographs are directly computed using the control points and weights of the given rational curves or surfaces.

• Journal of applied mathematics & informatics
• /
• v.2 no.2
• /
• pp.75-82
• /
• 1995

4대의 제어점에 의해 정의되는 3차 Bezier 곡선을 구간적 (piecewise) 2차 Bezier 곡선으로 근사 하는 기하적인 알고리듬을 제시한다. 또한 제시한알고리듬의 오차해석을 통하여 수정된 알 고리듬을 구성한다. 분확방법을 동시에 사용하여 주어진 허용오차 이내의 구간적 2차 근사 곡선을 구할수 있다. 제시한 알고리듬은 오차해석을 이용하여 필요한 분활의 수행회수를 미 리 결정할수있는장점을 가지고있다.

• Korean Journal of Computational Design and Engineering
• /
• v.1 no.2
• /
• pp.158-162
• /
• 1996

Algorithms to find the Bezier control points of the image of a Bezier domain curve on a Bezier surface are described. The diagonal image curve is analysed and the general linear case is transformed to the diagonal case. This proposed algorithm gives the closed form solution to find the control points of the image curve of a linear domain curve. If the domain curve is not linear, the image curve can be obtained by solving the system of linear equations.

• Korean Journal of Computational Design and Engineering
• /
• v.3 no.2
• /
• pp.113-120
• /
• 1998

Calculation of intersection points by two curves is fundamental to computer aided geometric design. Bezier clipping is one of the well-known curve intersection algorithms. However, this algorithm is only applicable to Bezier curve representation. Therefore, the NURBS curves that can represent free from curves and conics must be decomposed into constituent Bezier curves to find the intersections using Bezier clipping. And the respective pairs of decomposed Bezier curves are considered to find the intersection points so that the computational overhead increases very sharply. In this study, extended Bezier clipping which uses the linear precision of B-spline curve and Grevill's abscissa can find the intersection points of two NURBS curves without initial decomposition. Especially the extended algorithm is more efficient than Bezier clipping when the number of intersection points is small and the curves are composed of many Bezier curve segments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.8
• /
• pp.1861-1873
• /
• 1996

This paper describes the content-based image retrieval system that is implemented to retrieve images using constituent rate of lines and Bezier curves. We proposed the line and Bezier curve extraction algorithm which extracts lines and curve that are fitted on the contour information of images. For this extration, it was necessary to remove internal area of the proprocessed object within images and to approximate its contour to polygon, and proposed retrevial algorithm which gets the simularity using the consitituent rate of lines and curves and perform the simularity matching.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.24 no.6
• /
• pp.696-702
• /
• 2015

This paper suggests a new method for making a navigation path by using Bezier curve in order to improve the navigation performance used to avoid obstacles during a robot soccer game. We analyzed the advantages and disadvantages of both vector-field and limit-cycle navigation methods, which are the mostly widely used navigation methods for avoiding obstacles. To improve the disadvantages of these methods, we propose a new design technique for generating a more proper path using Bezier curve and describe its advantages. Using computer simulations and experiments, we compare the performance of vector-field navigation with that of Bezier curve navigation. The results prove that the navigation performance using Bezier curve is relatively superior to the other method.

• Korean Journal of Computational Design and Engineering
• /
• v.2 no.2
• /
• pp.122-129
• /
• 1997

Ball rolling blending is a popular technique for blending between parametric surfaces. The ball rolling blend surface is conceptually a trajectory of a ball rolling between two base sufaces. It is constructed by sweeping a circular arc along a ball contact curve pair. Since a ball rolling blend surfaces does not have a polynomial form like a Bezier surface patch, it is impossible to apply this method directly to a commercial CAD/CAM system. In this paper an algorithm is developed to approximate a ball rolling blend surface into Bezier surface patches. Least square method is applied to obtain proper Bezier surface patches under a given tolerance. The Bezier surface patches have degree three or more and guarantee VC1-continuity.

• Journal of Korean Society for Geospatial Information Science
• /
• v.7 no.1 s.13
• /
• pp.29-40
• /
• 1999

In vector GIS, natural linear entities (called linear entitles) are usually represented by a set of line segments. As an alternative of the line segments, curve segments can be used to represent the linear entities. The curve segments, as one-dimensional spatial objects, we generated by spline interpolation technique such as Bezier technique. In an effort to improve its accuracy in resembling the linear entities, the Bezier technique was modified generating a new technique (called New technique) (Kiyun, 1998). In this paper, validity of the New technique was tested. Test focused on answering two questions: (1) whether or not the curve segments from the New technique replace line segments so as to enhance the accuracy of representations of linear entities, and (2) whether or not the curve segments from the New technique represent the linear entities more accurately than curve segments from the Bezier technique. Answering these two questions entailed two hypothesis tests. For test data, a series of hydrologic lines on 7.5-minute USGS map series were selected. Test were done using t-test method and statistical inferences were made from the results. Test results indicated that curve segments from both the Bezier and New techniques represent the linear entities more accurately than the line segments do. In addition, curve segments from the New technique represent the linear entities more accurately than the line segments from the Bezier technique do at probability level 69% or higher.