• Journal of the Korean Society for Precision Engineering
• /
• v.13 no.12
• /
• pp.78-85
• /
• 1996

The determination of the optimum biarc curve passing through a given set of points along involute curve is studied. The method adopted is that of finding the optimum no. of span and the optimum length of the span such that the error between the biarc curve and involute curve is minimum. Irregular curve span method is effectively used to describe the involute curve with reduced length of NC-Code.

• Honam Mathematical Journal
• /
• v.38 no.3
• /
• pp.467-477
• /
• 2016

In this paper, we study the timelike Bertrand curves in Minkowski 3-space. Since the principal normal vector of a timelike curve is spacelike, the Bertrand mate curve of this curve can be a timelike curve, a spacelike curve with spacelike principal normal or a Cartan null curve, respectively. Thus, by considering these three cases, we get the necessary and sufficient conditions for a timelike curve to be a Bertrand curve. Also we give the related examples.

• Honam Mathematical Journal
• /
• v.39 no.4
• /
• pp.603-616
• /
• 2017

In this paper, we give some relations related with a spacelike principal-direction curve and a spacelike binormal-direction curve of a timelike Frenet curve. The Darboux-direction curve and the Darboux-rectifying curve of a timelike Frenet curve in Minkowski 3-space $E^3_1$ are introduced and some characterizations related with these associated curves are given. Later we define the spacelike V-direction curve which is associated with a timelike curve lying on a timelike oriented surface in $E^3_1$ and present some results together with the relationships between the curvatures of this associated curve.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.13 no.4
• /
• pp.257-265
• /
• 2009

In this paper we find an explicit form of upper bound of Hausdorff distance between given cubic spline curve and its quadratic spline approximation. As an application the approximation of offset curve of cubic spline curve is presented using our explicit error analysis. The offset curve of quadratic spline curve is exact rational spline curve of degree six, which is also an approximation of the offset curve of cubic spline curve.

• Bulletin of the Korean Mathematical Society
• /
• v.52 no.1
• /
• pp.183-200
• /
• 2015

In this paper, we define the directional associated curve and the self-associated curve of a null curve in Minkowski 3-space. We study the properties and relations between the null curve, its directional associated curve and its self-associated curve. At the same time, by solving certain differential equations, we get the explicit representations of some null curves.

• Journal of the Korean Society for Precision Engineering
• /
• v.16 no.4 s.97
• /
• pp.71-78
• /
• 1999

The determination of the optimum biarc curve passing through a given set of points along involute curve is studied. The method adopted is that of finding the optimum number of span and the optimum length of the span such that error between the biarc curve and involute curve minimum. Iterative method is effectively used to find the optimim number and length of the span on involute curve with reduced length of NC-code.

• Korean Journal of Computational Design and Engineering
• /
• v.11 no.3
• /
• pp.205-210
• /
• 2006

Curve tessellation, which generates a sequence of points from a curve, is very important for curves 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 chordal deviation on a curve segment. In the previous research a curve tessellation was tried by the subdivision method, that is, a curve is subdivided until the maximal chordal deviation is less than the given tolerance. On the other hand, a curve tessellation by sequential method is tried in this paper, that is, points are generated successively by using the local property of a curve. The sequential method generates relatively much less points than the subdivision method. Besides, the sequential method can generate a sequence of points from a spatial curve by approximation to a planar curve. The proposed method can be applied for high-accuracy curve tessellation and NC tool-path generation.

• Korean Journal of Computational Design and Engineering
• /
• v.1 no.2
• /
• pp.158-162
• /
• 1996

Algorithms to find the Bezier control points of the image of a Bezier domain curve on a Bezier surface are described. The diagonal image curve is analysed and the general linear case is transformed to the diagonal case. This proposed algorithm gives the closed form solution to find the control points of the image curve of a linear domain curve. If the domain curve is not linear, the image curve can be obtained by solving the system of linear equations.

• Honam Mathematical Journal
• /
• v.45 no.1
• /
• pp.130-145
• /
• 2023

In this paper, we define some integral curves connected with a framed curve in Euclidean 3-space. These curves include framed generalized principal-direction curve, framed generalized binormal-direction curve, framed principal-donor curve and framed Darboux-direction curve. We obtain some relations between the framed curvatures of new defined framed curves and framed curvatures of given framed curve. By using the obtained relationships we give some characterizations for such curves. We also give methods for constructing framed helix and framed slant helix from planar curves.

• Journal of Educational Research in Mathematics
• /
• v.22 no.1
• /
• pp.23-38
• /
• 2012

The purpose of this paper is to describe the true meaning of smooth curve and to let people understand the smooth curve by way of velocity. It is true that it is not easy for us to perceive smooth curve because when there are no cups in the curve and the shape of the curve looks smooth, we often perceive it is smooth curve. However, even when the shape of curve looks smooth, it happens that it is not smooth curve. When the particle moves on the curve, depending on the velocity, it can be smooth curve or not. That is, even though the shape looks smooth, when the velocity is discontinuous or it is 0, it is not smooth curve. Therefore, this paper shows that it is important to understand and to teach smooth curve by way of velocity. In other words, when parameter of path for the smooth curve is taught in the calculus of high school, it needs to be understood by way of velocity. Finally, this paper tries to suggest that we need to shift our paradigm in teaching of smooth curve from fixed curve to dynamic curve.