A VTK Algorithm for the Computation of the Hausdorff Distance

The VTK Journal Pub Date : 2011-09-22 DOI:10.54294/ys4vxd
F. Commandeur, J. Velut, O. Acosta
{"title":"A VTK Algorithm for the Computation of the Hausdorff Distance","authors":"F. Commandeur, J. Velut, O. Acosta","doi":"10.54294/ys4vxd","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":251524,"journal":{"name":"The VTK Journal","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"29","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The VTK Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.54294/ys4vxd","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 29

Abstract

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.
计算Hausdorff距离的VTK算法
豪斯多夫距离是点集之间距离的度量。与其他相似度度量相比,使用此度量有许多优点。本文档描述了一个VTK类,用于计算两组点之间的豪斯多夫距离。与其他实现相比,主要贡献在于不仅定义了到最近点的距离,而且定义了到表示表面上最近点的距离,即使在欠采样表面之间也能产生准确的测量。这是通过实现点到单元的距离而不是点对点的距离来实现的。此外,还实现了ParaView的插件,该插件也可以从代码中获得。在介绍了这个距离的意义之后,通过一些例子对VTK代码进行了解释和说明。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信