• Communications of the Korean Mathematical Society
• /
• v.22 no.4
• /
• pp.641-648
• /
• 2007

In this paper, we present the exact Hausdorff distance between the offset curve of quadratic $B\'{e}zier$ curve and its quadratic $GC^1$ approximation. To illustrate the formula for the Hausdorff distance, we give an example of the quadratic $GC^1$ approximation of the offset curve of a quadratic $B\'{e}zier$ curve.

• Korean Journal of Mathematics
• /
• v.23 no.1
• /
• pp.1-10
• /
• 2015

This paper concerns the rate of convergence in the multidimensional normal approximation of functional of Gaussian fields. The aim of the present work is to derive explicit upper bounds of the Kolmogorov distance for the rate of convergence instead of Wasserstein distance studied by Nourdin et al. [Ann. Inst. H. Poincar$\acute{e}$(B) Probab.Statist. 46(1) (2010) 45-98].

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.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.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.20 no.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.

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

• ETRI Journal
• /
• v.32 no.4
• /
• pp.630-633
• /
• 2010

In this letter, we propose a novel polygonal approximation of digital curves that preserve original shapes. The proposed method first detects break points, which have two different consecutive vectors, and sets an initial dominant point set. The approximation is then performed iteratively by deleting a dominant point using a novel distance, which can measure both the distance and the angle acuteness. The experimental results show that the proposed method can preserve original shapes and is appropriate for various shapes, including slab-sided shapes.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.5
• /
• pp.69-78
• /
• 2005

It is crucial to compute the Euclidean distance between two vectors efficiently in high dimensional space for multimedia information retrieval. In this paper, we propose an effective method for approximating the Euclidean distance between two high-dimensional vectors. For this approximation, a previous method, which simply employs norms of two vectors, has been proposed. This method, however, ignores the angle between two vectors in approximation, and thus suffers from large approximation errors. Our method introduces an additional vector called a reference vector for estimating the angle between the two vectors, and approximates the Euclidean distance accurately by using the estimated angle. This makes the approximation errors reduced significantly compared with the previous method. Also, we formally prove that the value approximated by our method is always smaller than the actual Euclidean distance. This implies that our method does not incur any false dismissal in multimedia information retrieval. Finally, we verify the superiority of the proposed method via performance evaluation with extensive experiments.

• Korean Journal of Computational Design and Engineering
• /
• v.15 no.2
• /
• pp.115-123
• /
• 2010

We present an efficient algorithm for computing the Hausdorff distance between two planar curves. The algorithm is based on an efficient trimming technique that eliminates the curve domains that make no contribution to the final Hausdorff distance. The input curves are first approximated with biarcs within a given error bound in a pre-processing step. Using the biarc approximation, the distance map of an input curve is then approximated and stored into the graphics hardware depth-buffer by rendering the distance maps (represented as circular cones) of the biarcs. We repeat the same procedure for the other input curve. By sampling points on each input curve and reading the distance from the other curve (stored in the hardware depth-buffer), we can easily estimate a lower bound of the Hausdorff distance. Based on the lower bound, the algorithm eliminates redundant curve segments where the exact Hausdorff distance can never be obtained. Finally, we employ a multivariate equation solver to compute the Hausdorff distance efficiently using the remaining curve segments only.

• Korean Journal of Mathematics
• /
• v.29 no.1
• /
• pp.81-89
• /
• 2021

In this paper, we introduce the notions of a distance function, Alexandrov topology and ⊖-upper (⊕-lower) approximation operator based on complete co-residuated lattices. Under various relations, we define (⊕, ⊖)-fuzzy rough set on complete co-residuated lattices. Moreover, we study their properties and give their examples.

• The KIPS Transactions:PartA
• /
• v.16A no.6
• /
• pp.509-518
• /
• 2009

In this paper, a mechanism that produces an approximation edges minimum spanning tree swiftly using virtual nodes called portals dividing given edges into same distance sub-edges. The approximation edges minimum spanning tree can be used in many useful areas as connecting communication lines, road networks and railroad systems. For 3000 random input edges, when portal distance is 0.3, tree building time decreased 29.74% while the length of the produced tree increased 1.8% comparing with optimal edge minimum spanning tree in our experiment. When portal distance is 0.75, tree building time decreased 39.96% while the tree length increased 2.96%. The result shows this mechanism might be well applied to the applications that may allow a little length overhead, but should produce an edge connecting tree in short time. And the proposed mechanism can produce an approximation edge minimum spanning tree focusing on tree length or on building time to meet user requests by adjusting portal distance or portal discard ratio as parameter.