COMPUTING THE HAUSDORFF DISTANCE BETWEEN CURVED OBJECTS

DOI10.1142/S0218195908002647zbMath1159.65021MaRDI QIDQ3527437

Helmut Alt, Ludmila Scharf

Publication date: 29 September 2008

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

algorithmsimilarityrational curveHausdorff distancemetrologysymbolic methodsfreeform surfacecomputer algebra system SYNAPSfreeform curve

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Metric theory of other algorithms and expansions; measure and Hausdorff dimension (11K55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (7)

Fast and robust Hausdorff distance computation from triangle mesh to quad mesh in near-zero cases ⋮ \(\mathrm{G}^2\) Hermite interpolation with quartic regular linear normal curves ⋮ Precise Hausdorff distance computation between polygonal meshes ⋮ The best \(G^{1}\) cubic and \(G^{2}\) quartic Bézier approximations of circular arcs ⋮ Approximating the Hausdorff distance by \(\alpha\)-dense curves ⋮ Convergence analysis of multivariate McCormick relaxations ⋮ Precise Hausdorff distance computation for freeform surfaces based on computations with osculating toroidal patches

Uses Software

• SYNAPS

Cites Work

• Improved test for closed loops in surface intersections
• Voronoi diagram and medial axis algorithm for planar domains with curved boundaries. II: Detailed algorithm description
• Voronoi diagram and medial axis algorithm for planar domains with curved boundaries. I: Theoretical foundations
• Bisector curves of planar rational curves.
• Approximate matching of polygonal shapes
• The Voronoi diagram of curved objects
• Specified–Precision Computation of Curve/Curve Bisectors

This page was built for publication: COMPUTING THE HAUSDORFF DISTANCE BETWEEN CURVED OBJECTS