• Journal of Integrative Natural Science
• /
• v.6 no.1
• /
• pp.46-52
• /
• 2013

In this thesis, we consider isoparametric curves of quadratic F-B$\acute{e}$zier curves. F-B$\acute{e}$zier curves unify C-B$\acute{e}$zier curves whose basis is {sint, cos t, t, 1} and H-B$\acute{e}$zier curves whose basis is {sinht, cosh t, t,1}. Thus F-B$\acute{e}$zier curves are more useful in Geometric Modeling or CAGD(Computer Aided Geometric Design). We derive the relation between the quadratic F-B$\acute{e}$zier curves and the quadratic rational B$\acute{e}$zier curves. We also obtain the geometric properties of isoparametric curve of the quadratic F-B$\acute{e}$zier curves at both end points and prove the continuity of the isoparametric curve.

• International Journal of CAD/CAM
• /
• v.9 no.1
• /
• pp.55-60
• /
• 2010

Quadratic B$\acute{e}$zier curves are important geometric entities in many applications. However, it was often ignored by the literature the fact that a single segment of a quadratic B$\acute{e}$zier curve may fail to fit arbitrary endpoint unit tangent vectors. The purpose of this paper is to provide a solution to this problem, i.e., constructing $G^1$ quadratic B$\acute{e}$zier curves satisfying given endpoint (positions and arbitrary unit tangent vectors) conditions. Examples are given to illustrate the new solution and to perform comparison between the $G^1$ quadratic B$\acute{e}$zier cures and other curve schemes such as the composite geometric Hermite curves and the biarcs.

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

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.4 no.2
• /
• pp.1-9
• /
• 2000

An algorithmic approach to degree elevation of B-spline curves is presented. The new algorithms are based on the blossoming process and its matrix representation. The elevation method is introduced that consists of the following steps: (a) decompose the B-spline curve into piecewise $B{\acute{e}}zier$ curves, (b) degree elevate each $B{\acute{e}}zier$ piece, and (c) compose the piecewise $B{\acute{e}}zier$ curves into B-spline curve.

• Journal of applied mathematics & informatics
• /
• v.26 no.3_4
• /
• pp.605-614
• /
• 2008

In this paper, we find the matrix representation of multi-degree reduction by $L_{\infty}$ of $B{\acute{e}}zier$ curves with constraints of endpoints continuity. Using the basis transformation between Chebyshev polynomials and Bernstein polynomials we can derive the matrix representation of multi-degree reduction of $B{\acute{e}}zier$ with respect to $L_{\infty}$ norm.

• Journal of Digital Convergence
• /
• v.12 no.12
• /
• pp.553-560
• /
• 2014

In this paper, we propose a method to convert 2D image to 3D anaglyph using quadratic & cubic B$\acute{e}$zier Curves in HTML5. In order to convert 2D image to 3D anaglyph image, we filter the original image to extract the RGB color values and create two images for the left and right eyes. Users are to set up the depth values of the image through the control point using the quadratic and cubic B$\acute{e}$zier curves. We have processed the depth values of 2D image based on this control point to create the 3D image conversion reflecting the value of the control point which the users select. All of this work has been designed and implemented in Web environment in HTML5. So we have made it for anyone who wants to create their 3D images and it is very easy and convenient to use.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.15 no.2
• /
• pp.123-135
• /
• 2011

In this paper, we present arc-length estimations for quadratic rational B$\acute{e}$zier curves using the length of polygon and distance between both end points. Our arc-length estimations coincide with the arc-length of the quadratic rational B$\acute{e}$zier curve exactly when the weight ${\omega}$ is 0, 1 and ${\infty}$. We show that for all ${\omega}$ > 0 our estimations are strictly increasing with respect to ${\omega}$. Moreover, we find the parameter ${\mu}^*$ which makes our estimation coincide with the arc-length of the quadratic rational B$\acute{e}$zier curve when it is a circular arc too. We also show that ${\mu}^*$ has a special limit, which is used for optimal estimation. We present some numerical examples, and the numerical results illustrates that the estimation with the limit value of ${\mu}^*$ is an optimal estimation.

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

• 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 Pure and Applied Mathematics
• /
• v.22 no.1
• /
• pp.25-34
• /
• 2015

In this paper we characterize the isogonal and isotomic conjugates of conic. Every conic can be expressed by a quadratic rational B$\acute{e}$zier curve having control polygon $b_0b_1b_2$ with weight w > 0. We show that the isotomic conjugate of parabola and hyperbola with respect to ${\Delta}b_0b_1b_2$ is ellipse, and that the isotomic conjugate of ellipse with the weight $w={\frac{1}{2}}$ is identical. We also find all cases of the isogonal conjugate of conic with respect to ${\Delta}b_0b_1b_2$. Our characterizations are derived easily due to the expression of conic by the quadratic rational B$\acute{e}$ezier curve in standard form.