DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zhang, Dejun | ko |
dc.contributor.author | He, Fazhi | ko |
dc.contributor.author | Han, Soonhung | ko |
dc.contributor.author | Zou, Lu | ko |
dc.contributor.author | Wu, Yiqi | ko |
dc.contributor.author | Chen, Yilin | ko |
dc.date.accessioned | 2017-08-08T06:53:59Z | - |
dc.date.available | 2017-08-08T06:53:59Z | - |
dc.date.created | 2017-08-02 | - |
dc.date.created | 2017-08-02 | - |
dc.date.issued | 2017 | - |
dc.identifier.citation | INTEGRATED COMPUTER-AIDED ENGINEERING, v.24, no.3, pp.261 - 277 | - |
dc.identifier.issn | 1069-2509 | - |
dc.identifier.uri | http://hdl.handle.net/10203/225263 | - |
dc.description.abstract | Hausdorff distance measure is very important in CAD/CAE/CAM related applications. This manuscript presents an efficient framework and two complementary subalgorithms to directly compute the exact Hausdorff distance for general 3D point sets. The first algorithm of Nonoverlap Hausdorff Distance (NOHD) combines branch-and-bound with early breaking to cut down the Octree traversal time in case of spatial nonoverlap. The second algorithm of Overlap Hausdorff Distance (OHD) integrates a point culling strategy and nearest neighbor search to reduce the number of points traversed in case of spatial overlap. The two complementary subalgorithms can achieve a highly efficient and balanced result. Both NOHD and OHD compute the exact Hausdorff distance directly for arbitrary 3D point sets. We conduct a number of experiments on benchmark models and CAD application models, and compare the proposed approach with other state-of-the-art algorithms. The results demonstrate the effectiveness of our method. | - |
dc.language | English | - |
dc.publisher | IOS PRESS | - |
dc.subject | FREEFORM GEOMETRIC-MODELS | - |
dc.subject | FIBROID ULTRASOUND IMAGES | - |
dc.subject | HUMAN FACE RECOGNITION | - |
dc.subject | CAD SYSTEMS | - |
dc.subject | STEEL CONNECTIONS | - |
dc.subject | MICROCAD SYSTEM | - |
dc.subject | DATA EXCHANGE | - |
dc.subject | DESIGN | - |
dc.subject | ALGORITHMS | - |
dc.subject | OPTIMIZATION | - |
dc.title | An efficient approach to directly compute the exact Hausdorff distance for 3D point sets | - |
dc.type | Article | - |
dc.identifier.wosid | 000405334800004 | - |
dc.identifier.scopusid | 2-s2.0-85018674009 | - |
dc.type.rims | ART | - |
dc.citation.volume | 24 | - |
dc.citation.issue | 3 | - |
dc.citation.beginningpage | 261 | - |
dc.citation.endingpage | 277 | - |
dc.citation.publicationname | INTEGRATED COMPUTER-AIDED ENGINEERING | - |
dc.identifier.doi | 10.3233/ICA-170544 | - |
dc.contributor.localauthor | Han, Soonhung | - |
dc.contributor.nonIdAuthor | Zhang, Dejun | - |
dc.contributor.nonIdAuthor | He, Fazhi | - |
dc.contributor.nonIdAuthor | Zou, Lu | - |
dc.contributor.nonIdAuthor | Wu, Yiqi | - |
dc.contributor.nonIdAuthor | Chen, Yilin | - |
dc.description.isOpenAccess | N | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | Hausdorff distance | - |
dc.subject.keywordAuthor | 3D point sets | - |
dc.subject.keywordAuthor | similarity | - |
dc.subject.keywordAuthor | octree | - |
dc.subject.keywordAuthor | branch and bound | - |
dc.subject.keywordAuthor | runtime analysis | - |
dc.subject.keywordPlus | FREEFORM GEOMETRIC-MODELS | - |
dc.subject.keywordPlus | FIBROID ULTRASOUND IMAGES | - |
dc.subject.keywordPlus | HUMAN FACE RECOGNITION | - |
dc.subject.keywordPlus | CAD SYSTEMS | - |
dc.subject.keywordPlus | STEEL CONNECTIONS | - |
dc.subject.keywordPlus | MICROCAD SYSTEM | - |
dc.subject.keywordPlus | DATA EXCHANGE | - |
dc.subject.keywordPlus | DESIGN | - |
dc.subject.keywordPlus | ALGORITHMS | - |
dc.subject.keywordPlus | OPTIMIZATION | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.