Efficient Computation of the Hausdorff Distance Between Polytopes by Exterior Random Covering

Authors:
Bernardo Llanas
Affiliations:
Departamento de Matemática Aplicada, ETSI de Caminos, Universidad Politécnica de Madrid, Ciudad Universitaria s/n, Madrid, Spain 28040
Venue:
Computational Optimization and Applications
Year:
2005

Citing 11
Cited 5

Numerical optimization techniques

Numerical optimization techniques
Group theoretical methods in image processing

Group theoretical methods in image processing
Approximate matching of polygonal shapes (extended abstract)

SCG '91 Proceedings of the seventh annual symposium on Computational geometry
A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes

Mathematical Programming: Series A and B
On Projection Algorithms for Solving Convex Feasibility Problems

SIAM Review
Geometric pattern matching under Euclidean motion

Computational Geometry: Theory and Applications - Special issue: computational geometry, theory and applications
Algorithmic geometry

Algorithmic geometry
Approximate Geometric Pattern Matching Under Rigid Motions

IEEE Transactions on Pattern Analysis and Machine Intelligence
Minimum Distance Between the Faces of Two Convex Polyhedra: A Sufficient Condition

Journal of Global Optimization
Efficient collision detection for animation and robotics

Efficient collision detection for animation and robotics
Hausdorff Matching and Lipschitz Optimization

Journal of Global Optimization

Fast training of neural trees by adaptive splitting based on cubature

Neurocomputing
Interactive Hausdorff distance computation for general polygonal models

ACM SIGGRAPH 2009 papers
Precise Hausdorff distance computation between polygonal meshes

Computer Aided Geometric Design
GPU-accelerated Hausdorff distance computation between dynamic deformable NURBS surfaces

Computer-Aided Design
Computing the Hausdorff distance between NURBS surfaces using numerical iteration on the GPU

Graphical Models

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a simple yet efficient randomized algorithm (Exterior Random Covering) for finding the maximum distance from a point set to an arbitrary compact set in Rd is presented. This algorithm can be used for accelerating the computation of the Hausdorff distance between complex polytopes.