Back

Cascading upper bounds for triangle soup Pompeiu‐Hausdorff distance.

  • Published In: Computer Graphics Forum, 2024, v. 43, n. 5. P. 1 1 of 3

  • Database: Academic Search Ultimate 2 of 3

  • Authored By: Sacht, Leonardo; Jacobson, Alec 3 of 3

Abstract

We propose a new method to accurately approximate the Pompeiu‐Hausdorff distance from a triangle soup A to another triangle soup B up to a given tolerance. Based on lower and upper bound computations, we discard triangles from A that do not contain the maximizer of the distance to B and subdivide the others for further processing. In contrast to previous methods, we use four upper bounds instead of only one, three of which newly proposed by us. Many triangles are discarded using the simpler bounds, while the most difficult cases are dealt with by the other bounds. Exhaustive testing determines the best ordering of the four upper bounds. A collection of experiments shows that our method is faster than all previous accurate methods in the literature. [ABSTRACT FROM AUTHOR]

Additional Information

  • Source:Computer Graphics Forum. 2024/08, Vol. 43, Issue 5, p1
  • Document Type:Article
  • Subject Area:Computer Science
  • Publication Date:2024
  • ISSN:0167-7055
  • DOI:10.1111/cgf.15129
  • Accession Number:179169318
  • Copyright Statement:Copyright of Computer Graphics Forum is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Looking to go deeper into this topic? Look for more articles on EBSCOhost.