• Journal of Integrative Natural Science
• /
• v.9 no.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.

• Communications of the Korean Mathematical Society
• /
• v.17 no.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.

• ETRI Journal
• /
• v.15 no.3
• /
• pp.35-45
• /
• 1994

In this paper we develop an approximation formalism on the queue length distribution for general queueing models. Our formalism is based on two steps of approximation; the first step is to find a lower bound on the exact formula, and subsequently the Chernoff upper bound technique is applied to this lower bound. We demonstrate that for the M/M/1 model our formula is equivalent to the exact solution. For the D/M/1 queue, we find an extremely tight lower bound below the exact formula. On the other hand, our approach shows a tight upper bound on the exact distribution for both the ND/D/1 and M/D/1 queues. We also consider the $M+{\Sigma}N_jD/D/1$ queue and compare our formula with other formalisms for the $M+{\Sigma}N_jD/D/1$ and M+D/D/1 queues.

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

• Communications of the Korean Mathematical Society
• /
• v.20 no.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.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.28 no.1
• /
• pp.22-32
• /
• 2024

In this paper we present a method of conic section approximation by hexic Bézier curves. The hexic Bézier approximants are G³ Hermite interpolations of conic sections. We show that there exists at least one hexic Bézier approximant for each weight of the conic section The hexic Bézier approximant depends one parameter and it can be obtained by solving a quartic polynomial, which is solvable algebraically. We present the explicit upper bound of the Hausdorff distance between the conic section and the hexic Bézier approximant. We also prove that our approximation method has the maximal order of approximation. The numerical examples for conic section approximation by hexic Bézier curves are given and illustrate our assertions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.6
• /
• pp.1178-1184
• /
• 1997

Encoding of segment contours is a critical part of a region-based coding system especially at low bit rates where the contour information occupies a majority of the bit rate. When approximating contours with polygons, a fixed upper bound on the distortion is set for the approximation process. Instead of using this fixed bound, adaptive approximation bound for a lossy coding of contourts is proposed in this paper. A function representing the relative importance of the contour segmentis defined to take into account the spatial content of the image. By using this function, the contour can be approximated adaptively. This allows a more general approach than the methods with the fixed distortion measure. The effectiveness of the adaptive contour coding approach is verified through experiments.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.34 no.2
• /
• pp.191-201
• /
• 2010

This paper presents a new global optimization algorithm based on the branch-and-bound principle using Bspline approximation techniques. It describes the algorithmic components and details on their implementation. The key components include the subdivision of a design space into mutually disjoint subspaces and the bound calculation of the subspaces, which are all established by a real-valued B-spline volume model. The proposed approach was demonstrated with various test problems to reveal computational performances such as the solution accuracy, number of function evaluations, running time, memory usage, and algorithm convergence. The results showed that the proposed algorithm is complete without using heuristics and has a good possibility for application in large-scale NP-hard optimization.

• Kyungpook Mathematical Journal
• /
• v.46 no.4
• /
• pp.489-496
• /
• 2006

The aim of this paper is to use the Stein-Chen method to obtain a non-uniform bound on Poisson approximation in matching problem.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.4B
• /
• pp.338-344
• /
• 2002

This paper proposes a transient (predictive) connection admission control (CAC) scheme using the transient quality of service (QoS) measure for CDMA cellular systems with bursts On-Off sources. We need an approximate and bounded approach for real-time CAC applications. We derive the transient outage probability as the QoS measure using the Chernoff bound and the refuted large deviation approximation. Numerical results show that the predictive CAC is a promising approach for the multicell CDMA systems.