• Journal of applied mathematics & informatics
• /
• 제18권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).

• 한국컴퓨터그래픽스학회논문지
• /
• 제6권1호
• /
• pp.37-50
• /
• 2000

본 논문에서는 R. T. Farouki에 의하여 소개된 평면 곡선들에 대한 복소수화된 표현법을 사용하여 주어진 임의의 평면 다항식 곡선을 복소수 계수를 갖는 한 다항식으로 나타내고 이 식을 대수학의 기본정리에 따라 복소수체 상에서 완전히 인수분해한 다음 그 근들을 관찰하여 주어진 곡선이 평면 다항식 피타고리안 호도그라프(PH) 곡선이 되기 위하 필요충분 조건을 새로운 방법으로 밝히고, 이를 3차원 민코브스키 공간 $R^{2,1}$ 상의 다항식 곡선에 적용, 이 곡선이 PH 곡선이 되기 위한 필요충분을 보다 간결한 형태로 나타내고 이를 통하여 3차원 민코브스키 공간 $R^{2,1}$ 상의 가능한 다항식 PH 곡선들의 유형이 모두 결정된다는 것을 보인다.

• 한국CDE학회논문집
• /
• 제9권2호
• /
• pp.158-163
• /
• 2004

Curve tessellation, which generates a sequence of points from a curve, is very important for curve rendering on a computer screen and for NC machining. For the most case the sequence of discrete points is used rather than a continuous curve. This paper deals with a method of tessellation by calculating the maximal deviation of a curve. The maximal deviation condition is introduced to find the point with the maximal deviation. Our approach has two merits. One is that it guarantees satisfaction of a given tolerance, and the other is that it can be applied in not only a polynomial curve but its offset. Especially the point sequence generated from an original curve can cause over-cutting in NC machining. This problem can be solved by using the point sequence generated from the offset curve. The proposed method can be applied for high-accuracy curve tessellation and NC tool-path generation.

• 대한수학회보
• /
• 제44권1호
• /
• pp.13-29
• /
• 2007

In this paper, we first present a method for finding the implicit equation of the curve given by rational parametric equations. The method is based on the computation of $Gr\"{o}bner$ bases. Then, another method for implicitization of curve and surface is given. In the case of rational curves, the method proceeds via giving the implicit polynomial f with indeterminate coefficients, substituting the rational expressions for the given curve and surface into the implicit polynomial to yield a rational expression $\frac{g}{h}$ in the parameters. Equating coefficients of g in terms of parameters to 0 to get a system of linear equations in the indeterminate coefficients of polynomial f, and finally solving the linear system, we get all the coefficients of f, and thus we obtain the corresponding implicit equation. In the case of polynomial surfaces, we can similarly as in the case of rational curves obtain its implicit equation. This method is based on characteristic set theory. Some examples will show that our methods are efficient.

• 한국공작기계학회논문집
• /
• 제11권3호
• /
• pp.80-85
• /
• 2002

The free curve gear is a non-circular gear without any relating center, which can perform free curve motion for complicated mechanisms, and minimize the work area. In this study, an algorithms for tooth profile generation of free curve involute gear is developed. The algorithm uses the involute gear creating principle in which a gear can be generated by rolling with another standard involute one. Cycloid me and third polynomial curve gears were designed and verified by computer graphics. These gears are manufactured in the wire-cut EDM and examined in engagement with a standard spur gear. The results showed that the proposed algorithm is successful to design and to manufacture the free curve gear with concave and convex profiles.

• 호남수학학술지
• /
• 제44권3호
• /
• pp.391-401
• /
• 2022

In this study, we investigate the explicit characterization of spherical curves using the Flc (Frenet like curve) frame in Euclidean 3-space. Firstly, the axis of curvature and the osculating sphere of a polynomial space curve are calculated using Flc frame invariants. It is then shown that the axis of curvature is on a straight line. The position vector of a spherical curve is expressed with curvatures connected to the Flc frame. Finally, a differential equation is obtained from the third order, which characterizes a spherical curve.

• 한국정보과학회논문지:시스템및이론
• /
• 제36권1호
• /
• pp.21-25
• /
• 2009

본 논문에서 우리는 평면상에 점들이 주어지는 경우에, 조각적 이차 다항식 곡선으로 맞추는 문제를 다룬다. 곡선은 이차 다항식 선분들로 이루어지고, 하나의 선분은 두 점 사이를 연결한다. 하지만 이 곡선은 점들의 부분집합만을 지나고, 지나지 못하는 점들에 대해서는 $L^{\infty}$거리로 에러를 측정한다. 이 문제에 대해서 우리는 두 가지 최적화 문제를 생각한다. 첫째로 허용 가능한 에러의 범위가 주어지고, 곡선 선분의 개수를 줄이는 문제이고, 둘째로 선분의 개수가 주어지고, 에러를 줄이는 문제이다. 주어진 점들의 개수 n에 대해서, 우리는 첫번째 문제에 대한 $O(n^2)$ 알고리즘과 두번째 문제에 대한 $O(n^3)$ 알고리즘을 제안한다.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제2권1호
• /
• pp.88-93
• /
• 1998

It is frequently important to approximate a rational B$\acute{e}$zier curve by an integral, i.e., polynomial one. This need will arise when a rational B$\acute{e}$zier curve is produced in one CAD system and is to be imported into another system, which can only handle polynomial curves. The objective of this paper is to present an algorithm to approximate rational B$\acute{e}$zier curves with polynomial curves of higher degree.

• Kyungpook Mathematical Journal
• /
• 제55권3호
• /
• pp.741-752
• /
• 2015

We introduce the warping crossing polynomial of an oriented knot diagram by using the warping degrees of crossing points of the diagram. Given a closed transversely intersected plane curve, we consider oriented knot diagrams obtained from the plane curve as states to take the sum of the warping crossing polynomials for all the states for the plane curve. As an application, we show that every closed transversely intersected plane curve with even crossing points has two independent canonical orientations and every based closed transversely intersected plane curve with odd crossing points has two independent canonical orientations.

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