Computation of the Minimum One-sided Hausdorff Distance between Plane Curves under a Similarity Transformation and Relevant Applications in Roundness Error Evaluation
Keywords:
Fuzzy controller, PID controller, two-wheeled balance robot, Continuous plane curve, Minimum one-sided Hausdorff distance, Exact algorithm, Comparison of computational efficiency, Roundness error evaluation.Abstract
A two-stage (rough and accurate) computation strategy was developed in this study in order to accurately calculate the minimum one-sided Hausdorff distance between continuous plane curves under a similarity transformation. In the rough computation, a mathematical programming model based on the discretisation method was constructed to ascertain the minimum one-sided Hausdorff distance. In addition, the linearisation method in this model was elucidated. Based on that, the solutions were attained through a stable and efficient simplex method and 5 characteristic points were obtained. In the accurate computation, a local iterative accurate algorithm for computing the minimum one-sided Hausdorff distance was established after 4 similarity transformation parameters were separated from 10 curve parameters corresponding to 5 characteristic points. Similar results, which verify the feasibility of this algorithm, were obtained based on rough and accurate computations in a numerical example. Moreover, a roundness error evaluation programming model based on the minimum one-sided Hausdorff distance and relevant linear solution methods was also developed. Furthermore, the numerical examples based on this model were compared with those based on a conventional roundness error computation model. The results revealed that similar computation circle centre coordinates, roundness error, and characteristic points can be obtained based on both models. The computational efficiency can be significantly improved via the method proposed in this study.Continuous plane curve, Minimum one-sided Hausdorff distance, Exact algorithm, Comparison of computational efficiency, Roundness error evaluation.
References
H. Alt, L. Scharf (2008) Computing the Hausdorff distance between curved objects. 18, 307–320.
G. Elber, T. Grandine (2008) Hausdorff and minimal distances between parametric freeforms in R2 and R3. 191–204.
X.D. Chen, W.Y. Ma, G. Xu, et al. (2010) Computing the Hausdorff distance between two B-spline curves. 42, 1197–1206.
Y.J. Kim, Y.T. Oh, S.H. Yoon, et al. (2010) Precise Hausdorff distance computation for planar freeform curves using biarcs and depth buffer. 26, 1007–1016.
Y.B. Bai, J.H. Yong, C.Y. Liu, et al. (2011) Polyline approach for approximating Hausdorff distance between planar free-form curves. 43(6), 687–698.
D.P. Huttenlocher, K. Kedem (1990) Computing the minimum Hausdorff distance for point sets under translation. 340-349.
D.P. Huttenlocher, K. Kedem, M. Sharir (1993) The upper envelope of Voronoi surface and its applications. 9(1), 267-291.
H. Alt, B. Behrends, J. Blomer, et al. (1995) Approximate matching of polygonal shapes. 13, 251–265.
L.P. Chew, M.T. Goodrich, D.P. Huttenlocher, et al. (1997) Geometric pattern matching under Euclidean motion. 7(1-2), 113-124.
S. Hur, T.W. Kim (2009) Finding the best conic approximation to the convolution curve of two compatible conics based on Hausdorff distance. 41(7), 513-524.
Y.H. Gu, T. Tjahjadi (2000) Coarse-to-fine planar object identification using invariant curve features and B-spline modeling. 33(9), 1411-1422.
B.J. Liang, A.M. Wallace (2004) Viewpoint independent matching of planar curves in 3D space. 37(3), 525-542.
A. Gruen, D. Akca (2005) Least squares 3D surface and curve matching. 59(3), 151-174.
W. Rodriguez, M. Last, A. Kandel, et al. (2004) 3-Dimensional curve similarity using string matching. 49(3-4), 165–172.
S.M. Yamany, M.N. Ahmed, A.A. Farag (1999) A new genetic-based technique for matching 3-D curves and surfaces. 32(10), 1817-1820.
L.X. Cao, L. Dong, J.J. Cao (2014) Computation of Hausdorff distance between planar curves. 54(2), 182-188.
L.X. Cao, L.J. Qin (2015) Evaluation Method of Line Profile Error Based on Minimum Directed Hausdorff Distance. 34(10), 1547-1552.
L. Piegl, W. Tiller (1997) The NURBS Book.
J. Liu, X.M. Wang (1996) Saddle point programming and geometric error evaluation.
(1982) Dimensioning and Tolerancing.
(1983) Technical drawings—Geometrical tolerancing—Guidelines.
(1980) Tolerance and Position Tolerance.
T. Weber, S. Motavalli, B. Fallahi (2002) A unified approach to form error evaluation. 26, 269–278.
Y. Ding, L.M. Zhu, H. Ding (2007) A unified approach for circularity and spatial straightness evaluation using semi-definite programming. 47, 1646–1650.
L.M. Zhu, H. Han Ding, Y.L. Xiong (2003) A steepest descent algorithm for circularity evaluation. 35, 255-265.
H.W. Tang (1986) Introduction to Practical mathematical programming.
Donald M. Simmons (1975) Nonlinear programming for operations research.
S.G. Samuel, M.S. Shunmugam (2000) Evaluation of circularity from coordinate and form data using computational geometric techniques. 24, 251–263.
Downloads
Published
Issue
Section
License
Copyright (c) 2025 Authors and Global Journals Private Limited
This work is licensed under a Creative Commons Attribution 4.0 International License.
