Open AccessA VTK Algorithm for the Computation of the Hausdorff Distance
Author(s) -
Frédéric Commandeur,
Jérôme Velut,
Oscar Acosta
Publication year - 2011
Publication title -
vtk journal
Language(s) - English
Resource type - Journals
ISSN - 2328-3459
DOI - 10.54294/ys4vxd
Subject(s) - hausdorff distance , point (geometry) , distance transform , measure (data warehouse) , mathematics , similarity (geometry) , metric (unit) , algorithm , computation , code (set theory) , distance measures , minkowski distance , computer science , euclidean distance , set (abstract data type) , image (mathematics) , artificial intelligence , geometry , data mining , mathematical analysis , operations management , economics , programming language
The Hausdorff distance is a measure of the distance between sets of points. There are many advantages to using this metric compared to other similarity measures. This document describes a VTK class for computing the Hausdorff Distance between two sets of points. The main contribution, compared to other implementations, lies in the definition of the distance not only to the closest point but to the closest point in the represented surface, which yields an accurate measure even between undersampled surfaces. This is achieved by implementing a point-to-cell distance instead of a point-to-point. Furthermore, a plugin for ParaView was implemented, which is also available with the code. After introducing the interest of this distance, the VTK code is explained and illustrated with some examples.