Cascading Upper Bounds for Triangle Soup Pompeiu-Hausdorff Distance

Simple item page
dc.contributor.authorSacht, Leonardoen_US
dc.contributor.authorJacobson, Alecen_US
dc.contributor.editorHu, Ruizhenen_US
dc.contributor.editorLefebvre, Sylvainen_US
dc.date.accessioned2024-06-20T07:54:46Z
dc.date.available2024-06-20T07:54:46Z
dc.date.issued2024
dc.description.abstractWe 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.en_US
dc.description.number5
dc.description.sectionheadersDistances
dc.description.seriesinformationComputer Graphics Forum
dc.description.volume43
dc.identifier.doi10.1111/cgf.15129
dc.identifier.issn1467-8659
dc.identifier.pages12 pages
dc.identifier.urihttps://doi.org/10.1111/cgf.15129
dc.identifier.urihttps://diglib.eg.org/handle/10.1111/cgf15129
dc.publisherThe Eurographics Association and John Wiley & Sons Ltd.en_US
dc.subjectCCS Concepts: Computing methodologies → Computer graphics; Mathematics of computing → Mathematical optimization
dc.subjectComputing methodologies → Computer graphics
dc.subjectMathematics of computing → Mathematical optimization
dc.titleCascading Upper Bounds for Triangle Soup Pompeiu-Hausdorff Distanceen_US
Files
Original bundle
Now showing 1 - 2 of 2
Thumbnail Image
Name:
v43i5_02_cgf15129.pdf
Size:
14.8 MB
Format:
Adobe Portable Document Format
Download
Thumbnail Image
Name:
paper1044_supp.pdf
Size:
158.39 KB
Format:
Adobe Portable Document Format
Download
Collections
43-Issue 5