• 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 for History of Mathematics
• /
• v.27 no.5
• /
• pp.329-345
• /
• 2014

CAGD(Computer Aided Geometric Design) is a branch of applied mathematics concerned with algorithms for the design of smooth curves and surfaces and for their efficient mathematical representation. The representation is used for the computation of the curves and surfaces, as well as geometrical quantities of importance such as curvatures, intersection curves between two surfaces and offset surfaces. The $B\acute{e}zier$ curves, B-spline, rational $B\acute{e}zier$ curves and NURBS(Non-Uniform Rational B-Spline) are basically and widely used in CAGD. The definitions and properties of these curves are presented in this paper. And a brief history of study on the bound for derivative of rational curves in CAGD is also presented.

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

• Korean Journal of Computational Design and Engineering
• /
• v.4 no.4
• /
• pp.312-317
• /
• 1999

An inflection point on a curve is a point where the curvature vanishes. An inflection point is useful for various geometric operations such as the approximation of curves and intersection points between curves or curve approximations. An inflection point on planar Bezier curves can be easily detected using a hodograph and a derivative of hodograph, since the closed from of hodograph is known. In the case of rational Bezier curves, for the detection of inflection point, it is needed to use the first and the second derivatives have higher degree and are more complex than those of non-rational Bezier curvet. This paper presents three methods to detect inflection points of rational Bezier curves. Since the algorithms avoid explicit derivations of the first and the second derivatives of rational Bezier curve to generate polynomial of relatively lower degree, they turn out to be rather efficient. Presented also in this paper is the theoretical analysis of the performances of the algorithms as well as the experimental result.

• East Asian mathematical journal
• /
• v.26 no.1
• /
• pp.69-73
• /
• 2010

We invoke the characterization of Pythagorean-hodograph polynomial curves and prove that it is impossible to parameterize any real curves, other than a straight line, by rational functions of its arc length.

• Bulletin of the Korean Mathematical Society
• /
• v.35 no.1
• /
• pp.149-156
• /
• 1998

We relate the existence of rational curves with the existence of rigid bundles of any even rank on Enriques surfaces and compare with the case of K3 surfaces.

• East Asian mathematical journal
• /
• v.40 no.1
• /
• pp.75-83
• /
• 2024

For a reduced, irreducible and nondegenerate curve C ⊂ ℙ^r of degree d, it was shown that the arithmetic genus g of C has an upper bound π₀(d, r) by G. Castelnuovo. And he also classified the curves that attain the extremal value. These curves are arithmetically Cohen-Macaulay and contained in a surface of minimal degree. In this paper, we investigate the arithmetic genus of curves lie on a surface of minimal degree - the Veronese surface, smooth rational normal surface scrolls and singular rational normal surface scrolls. We also provide a construction of curves on singular rational normal surface scroll S(0, 2) ⊂ ℙ³ which attain the maximal arithmetic genus.

• Journal of applied mathematics & informatics
• /
• v.14 no.1_2
• /
• pp.405-413
• /
• 2004

Rational parameterization of curves and surfaces is one of the main topics in computer-aided geometric design because of their computational advantages. Pythagorean hodograph (PH) curves and Minkowski Pythagorean hodograph (MPH) curves have attracted many researcher's interest because they provide for rational representation of their offset curves in Euclidean space and Minkowski space, respectively. In [10], Kim presented the characterization of the PH curves in the Euclidean space and analyzed the relation between the class of PH curves and the class of rational curves. In this paper, we extend the characterization of PH curves in [10] into that of MPH curves in the general Minkowski space and consider some generalized MPH curves satisfying this characterization.

• Journal of applied mathematics & informatics
• /
• v.19 no.1_2
• /
• pp.241-251
• /
• 2005

In this paper, we introduce a new algebraic method to characterize rational PH plane curves. And using this method, we study the algebraic characterization of generic strongly regular rational plane PH curves expressed in the complex formalism which is introduced by R.T. Farouki. We prove that generic strongly semi-regular rational PH plane curves are completely characterized by solving a simple functional equation H(f, g) = $h^2$ where h is a complex polynomial and H is a bi-linear operator defined by H(f, g) = f'g - fg' for complex polynomials f,g.