• 통합자연과학논문집
• /
• 제9권1호
• /
• pp.10-15
• /
• 2016

In this paper the approximation methods of offset curve of conic with explicit error bound are considered. The quadratic approximation of conic(QAC) method, the method based on quadratic circle approximation(BQC) and the Pythagorean hodograph cubic(PHC) approximation have the explicit error bound for approximation of offset curve of conic. We present the explicit upper bound of the Hausdorff distance between the offset curve of conic and its PHC approximation. Also we show that the PHC approximation of any symmetric conic is closer to the line passing through both endpoints of the conic than the QAC.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제17권3호
• /
• pp.171-179
• /
• 2013

In this paper we present a method of circular arc approximation by quartic B$\acute{e}$zier curve. Our quartic approximation method has a smaller error than previous quartic approximation methods due to the alternation of the error function of our quartic approximation. Our method yields a closed form of error so that subdivision algorithm is available, and curvature-continuous quartic spline under the subdivision of circular arc with equal-length until error is less than tolerance. We illustrate our method by some numerical examples.

• 대한수학회논문집
• /
• 제17권4호
• /
• pp.741-754
• /
• 2002

In this paper we present an error bound for cubic spline approximation of conic section curve. We compare it to the error bound proposed by Floater [1]. The error estimating function proposed in this paper is sharper than Floater's at the mid-point of parameter, which means the overall error bound is sharper than Floater's if the estimating function has the maximum at the midpoint.

• Kyungpook Mathematical Journal
• /
• 제52권2호
• /
• pp.167-177
• /
• 2012

In this article, we propose exponentially fitted error correction methods(EECM) which originate from the error correction methods recently developed by the authors (see [10, 11] for examples) for solving nonlinear stiff initial value problems. We reduce the computational cost of the error correction method by making a local approximation of exponential type. This exponential local approximation yields an EECM that is exponentially fitted, A-stable and L-stable, independent of the approximation scheme for the error correction. In particular, the classical explicit Runge-Kutta method for the error correction not only saves the computational cost that the error correction method requires but also gives the same convergence order as the error correction method does. Numerical evidence is provided to support the theoretical results.

• 대한전자공학회논문지
• /
• 제25권1호
• /
• pp.56-62
• /
• 1988

For shape description, a fast sequential method for polygonal approximation of chaincoded plane curves which are object boundaries is proposed. The proposed method performs polygonal approximation by use of the distance error from one point to a line, and its performance is enhanced by the smoothed slopes of lines. Furthermore, accumulated distance error and variable distance error threshold are proposed in order to consider and implement the visual characteristics of the human being.

• 한국CDE학회논문집
• /
• 제17권4호
• /
• pp.282-293
• /
• 2012

This paper presents an error-bounded B-spline fitting technique to approximate unorganized data within a prescribed error tolerance. The proposed approach includes two main steps: leastsquares minimization and error-bounded approximation. A B-spline hypervolume is first described as a data representation model, which includes its mathematical definition and the data structure for implementation. Then we present the least-squares minimization technique for the generation of an approximate B-spline model from the given data set, which provides a unique solution to the problem: overdetermined, underdetermined, or ill-conditioned problem. We also explain an algorithm for the error-bounded approximation which recursively refines the initial base model obtained from the least-squares minimization until the Euclidean distance between the model and the given data is within the given error tolerance. The proposed approach is demonstrated with some examples to show its usefulness and a good possibility for various applications.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제20권2호
• /
• pp.151-161
• /
• 2016

In this paper, we present a $C^3$ quartic B-spline approximation of circular arcs. The Hausdorff distance between the $C^3$ quartic B-spline curve and the circular arc is obtained in closed form. Using this error analysis, we show that the approximation order of our approximation method is six. For a given circular arc and error tolerance we find the $C^3$ quartic B-spline curve having the minimum number of control points within the tolerance. The algorithm yielding the $C^3$ quartic B-spline approximation of a circular arc is also presented.

• 대한기계학회논문집
• /
• 제17권8호
• /
• pp.1963-1970
• /
• 1993

A simple technique to decouple the modal equations of motion of a linear nonclassically damped system is to neglect the off-diagonal elements of the modal damping matrix. This is called the decoupling approximation. It has generally been conceived that smallness of off-diagonal elements relative to the diagonal ones would validate its use. In this study, the relationship between elements of the modal damping matrix and the error arising from the decoupling approximation is explored. It is shown that the enhanced diagonal dominance of the modal damping matrix need not diminish the error. In fact, the error may even increase. Moreover, the error is found to be strongly dependent on the exitation. Therefore, within the practical range of engineering applications, diagonal dominance of the modal damping matrix would not be sufficient to supress the effect of modal coupling.

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

• 대한수학회논문집
• /
• 제20권4호
• /
• pp.861-873
• /
• 2005

In this paper we approximate a cylindrical helix by bi-conic and bi-quadratic Bezier curves. Each approximation method is $G^1$ end-points interpolation of the helix. We present a sharp upper bound of the Hausdorff distance between the helix and each approximation curve. We also show that the error bound has the approximation order three and monotone increases as the length of the helix increases. As an illustration we give some numerical examples.