• 통합자연과학논문집
• /
• 제6권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
• /
• 제9권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
• /
• 제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.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제4권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.

• 디지털융복합연구
• /
• 제12권12호
• /
• pp.553-560
• /
• 2014

본 논문에서는 HTML5에서 Quadratic & Cubic B$\acute{e}$zier 곡선을 이용하여 2D 이미지를 3D 입체 이미지로 변환하는 방법을 제안한다. 3D 입체 이미지 변환은 원본 이미지에서 RGB색상 값을 분리 추출하여 좌안과 우안을 위한 2개의 이미지로 필터링한다. 사용자는 Quadratic B$\acute{e}$zier 곡선과 Cubic B$\acute{e}$zier곡선을 이용한 제어 점을 통해 이미지의 깊이 값을 설정하게 된다. 이 제어 점을 기반으로 2D 이미지의 깊이 값을 계산하여 3D이미지에 반영하게 된다. 이 모든 과정은 HTML5를 사용한 웹 환경에서 구현하였으며, 사용자들은 매우 쉽고 편리하게 자신들이 원하는 3D 이미지를 만들 수 있게 하였다.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제15권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 of applied mathematics & informatics
• /
• 제26권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.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제22권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.

• 한국CDE학회논문집
• /
• 제3권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.

• 한국정보통신학회논문지
• /
• 제21권2호
• /
• pp.265-276
• /
• 2017

본 논문에서는 하중 적분 PDC 제어 기법과 T-S 퍼지 외란 관측기를 이용한 강인하면서도 보다 정확한 이동 로봇의 궤도 추적 제어 방법을 제안한다. 하중 적분 PDC 제어 기법은 PDC 제어 기법에 하중 적분 항을 추가함으로써 정상상태 오차를 감소시켜 준다. T-S 퍼지 외란 관측기는 T-S 퍼지 모델로 표현된 비선형 시스템에 대해 외란을 추정하고 상쇄시킬 수 있도록 한다. 따라서, T-S 퍼지 외란 관측기에 기반한 궤도 추적 제어기는 강인한 궤도 추적 성능을 보여준다. 또한, 본 연구에서는 $B\acute{e}zier$ 곡선에 의한 가속도 제한을 갖는 경로 설계 방법에 의해 초기 접근 경로를 설계함으로써, 이동 로봇의 초기 위치가 기준 궤도의 초기 위치와 다를 때 제어 입력이 매우 커지게 되어 실제적으로 사용할 수 없게 되는 문제를 해결한다. 제안된 궤도 추적 제어기의 성능을 시뮬레이션을 통해서 입증하였다.