• 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).

• Journal of the Korea Computer Graphics Society
• /
• v.6 no.1
• /
• pp.37-50
• /
• 2000

Using the complex formulation of plane curves which R. T. Farouki introduced, we can identify any plane polynomial curve with only a polynomial with complex coefficients. In this paper, using the well-known fundamental theorem of algebra, we completely factorize the polynomial over the complex number field C and from the completely factorized form of the polynomial, we find a new necessary and sufficient condition for a plane polynomial curve to be a Pythagorean-hodograph curve, obseving the set of all roots of the complex polynomial corresponding to the plane polynomial curve. Applying this method to space polynomial curves in the three dimensional Minkowski space $R^{2,1}$, we also find the necessary and sufficient condition for a polynomial curve in $R^{2,1}$ to be a PH curve in a new finer form and characterize all possible curves completely.

• Korean Journal of Computational Design and Engineering
• /
• v.9 no.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.

• Bulletin of the Korean Mathematical Society
• /
• v.44 no.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.

• Transactions of the Korean Society of Machine Tool Engineers
• /
• v.11 no.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.

• Honam Mathematical Journal
• /
• v.44 no.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.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.1
• /
• pp.21-25
• /
• 2009

In this paper, we study the problem to fit a piecewise-quadratic polynomial curve to points in the plane. The curve consists of quadratic polynomial segments and two points are connected by a segment. But it passes through a subset of points, and for the points not to be passed, the error between the curve and the points is estimated in $L^{\infty}$ metric. We consider two optimization problems for the above problem. One is to reduce the number of segments of the curve, given the allowed error, and the other is to reduce the error between the curve and the points, while the curve has the number of segments less than or equal to the given integer. For the number n of given points, we propose $O(n^2)$ algorithm for the former problem and $O(n^3)$ algorithm for the latter.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.2 no.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
• /
• v.55 no.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.

• Korean Journal of Computational Design and Engineering
• /
• v.5 no.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.