Efficient computation of the Hausdorff distance between polytopes by exterior random covering

DOI10.1007/s10589-005-4560-zzbMath1112.90101OpenAlexW2036796788MaRDI QIDQ1774572

Bernardo Llanas

Publication date: 17 May 2005

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-005-4560-z

zbMATH Keywords

polytopespolyhedraHausdorff distancemaximum distanceprojection algorithmsLipschitz random covering

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (5)

Uniform tree approximation by global optimization techniques ⋮ Precise Hausdorff distance computation between polygonal meshes ⋮ Representation complexity of adaptive 3D distance fields ⋮ Hausdorff matching and Lipschitz optimization ⋮ The obstacle avoidance motion planning problem for autonomous vehicles: a low-demanding receding horizon control scheme

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Geometric pattern matching under Euclidean motion
• The upper envelope of Voronoi surfaces and its applications
• Geometric pattern matching in \(d\)-dimensional space
• A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes
• Finding the projection on a polytope: An iterative method
• Minimum distance between the faces of two convex polyhedra: A sufficient condition
• An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\)
• Approximate matching of polygonal shapes
• Hausdorff matching and Lipschitz optimization
• Optimization and nonsmooth analysis
• A linear time algorithm for the computation of some distance functions between convex polygons
• Finding the nearest point in A polytope
• Progressive global random search of continuous functions
• On Projection Algorithms for Solving Convex Feasibility Problems
• Convex Analysis

This page was built for publication: Efficient computation of the Hausdorff distance between polytopes by exterior random covering