To What Extent Are Existing Volume Mapping Algorithms Practically Useful?

Simple item page
dc.contributor.authorMeloni, Federicoen_US
dc.contributor.authorCherchi, Gianmarcoen_US
dc.contributor.authorScateni, Riccardoen_US
dc.contributor.authorLivesu, Marcoen_US
dc.contributor.editorCaputo, Arielen_US
dc.contributor.editorGarro, Valeriaen_US
dc.contributor.editorGiachetti, Andreaen_US
dc.contributor.editorCastellani, Umbertoen_US
dc.contributor.editorDulecha, Tinsae Gebrechristosen_US
dc.date.accessioned2024-11-11T12:48:33Z
dc.date.available2024-11-11T12:48:33Z
dc.date.issued2024
dc.description.abstractMappings between geometric domains play a crucial role in many algorithms in geometry processing and are heavily used in various applications. Despite the significant progress made in recent years, the challenge of reliably mapping two volumes still needs to be solved to an extent that is satisfactory for practical applications. This paper offers a review of provably robust volume mapping algorithms, evaluating their performances in terms of time, memory and ability to generate a correct result both with exact and inexact numerical models. We have chosen and evaluated the two most advanced methods currently available, using a state-of-the-art benchmark designed specifically for this type of analysis. We are sharing both the statistical results and specific volume mappings with the community, which can be utilized by future algorithms for direct comparative analysis. We also provide utilities for reading, writing, and validating volume maps encoded with exact rational coordinates, which is the natural form of output for robust algorithms in this class. All in all, this benchmark offers a neat overview of where do we stand in terms of ability to reliably solve the volume mapping problem, also providing practical data and tools that enable the community to compare future algorithmic developments without the need to re-run existing methods.en_US
dc.description.sectionheadersShape Analysis
dc.description.seriesinformationSmart Tools and Applications in Graphics - Eurographics Italian Chapter Conference
dc.identifier.doi10.2312/stag.20241346
dc.identifier.isbn978-3-03868-265-3
dc.identifier.issn2617-4855
dc.identifier.pages8 pages
dc.identifier.urihttps://doi.org/10.2312/stag.20241346
dc.identifier.urihttps://diglib.eg.org/handle/10.2312/stag20241346
dc.publisherThe Eurographics Associationen_US
dc.rightsAttribution 4.0 International License
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/
dc.subjectCCS Concepts: Computing methodologies → Mesh models; Volumetric models; Volumetric Mappings
dc.subjectComputing methodologies → Mesh models
dc.subjectVolumetric models
dc.subjectVolumetric Mappings
dc.titleTo What Extent Are Existing Volume Mapping Algorithms Practically Useful?en_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
stag20241346.pdf
Size:
939.68 KB
Format:
Adobe Portable Document Format
Download
Collections
Italian Chapter Conference 2024 - Smart Tools and Apps in Graphics