A VTK Algorithm for the Computation of the Hausdorff Distance
INSERM, U 642, Rennes, F-35000, France, Université de Rennes 1, LTSI
| Please use this identifier to cite or link to this publication: http://hdl.handle.net/10380/3322 |
Published in The VTK Journal - 2011 January-December Submissions.
Submitted by Frédéric Commandeur on 09-22-2011.
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.
Code
Automatic Testing Results
by Insight-Journal Dashboard
on Thu Oct 6 08:37:45 2011 for revision #2 



expertise: 5 sensitivity: 5 Click here for more details.
Go here to access the main testing dashboard.
Automatic Testing Results
by Insight-Journal Dashboard
on Tue Sep 27 20:03:04 2011 for revision #1 



expertise: 5 sensitivity: 5 Reviews
Quick Comments
Resources
| Download Package | |
| Download Paper, View Paper | |
| Download Source code | |
| Github | |
Statistics more
| Global rating: | ![]() ![]() ![]() ![]()
|
| Review rating: | ![]() ![]() ![]() ![]() [review]
|
| Code rating: | ![]() ![]() ![]() ![]()
|
| Paper Quality: |
|
Information more
| Categories: | Mathematics, Mesh, PointSet |
| Keywords: | Hausdorff Distance, Surfaces Comparison, |
| Toolkit: | VTK |
| Export citation: | |
Share
View license
Loading license...
Send a message to the author


