Massively Parallel Adaptive Collapsing of Edges for Unstructured Tetrahedral Meshes

Simple item page
dc.contributor.authorStröter, Danielen_US
dc.contributor.authorStork, Andréen_US
dc.contributor.authorFellner, Dieter W.en_US
dc.contributor.editorBikker, Jaccoen_US
dc.contributor.editorGribble, Christiaanen_US
dc.date.accessioned2023-06-25T09:07:09Z
dc.date.available2023-06-25T09:07:09Z
dc.date.issued2023
dc.description.abstractMany tasks in computer graphics and engineering involve unstructured tetrahedral meshes. Numerical methods such as the finite element method (FEM) oftentimes use tetrahedral meshes to compute a solution for complex problems such as physicallybased simulation or shape deformation. As each tetrahedron costs computationally, coarsening tetrahedral meshes typically reduces the overhead of numerical methods, which is attractive for interactive applications. In order to enable reduction of the tetrahedron count, we present a quick adaptive coarsening method for unstructured tetrahedral meshes. Our method collapses edges using the massively parallel processing power of present day graphics processing units (GPU)s to achieve run times of up to one order of magnitude faster than sequential collapsing. For efficient exploitation of parallel processing power, we contribute a quick method for finding a compact set of conflict-free sub-meshes, which results in up to 59% fewer parallel collapsing iterations compared to the state of the art massively parallel conflict detection.en_US
dc.description.sectionheadersGPU Computing
dc.description.seriesinformationHigh-Performance Graphics - Symposium Papers
dc.identifier.doi10.2312/hpg.20231139
dc.identifier.isbn978-3-03868-229-5
dc.identifier.issn2079-8687
dc.identifier.pages89-99
dc.identifier.pages11 pages
dc.identifier.urihttps://doi.org/10.2312/hpg.20231139
dc.identifier.urihttps://diglib.eg.org:443/handle/10.2312/hpg20231139
dc.publisherThe Eurographics Associationen_US
dc.rightsAttribution 4.0 International License
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/
dc.subjectCCS Concepts: Theory of computation -> Massively parallel algorithms; Computing methodologies -> Volumetric models; Simulation tools; Physical simulation; Mathematics of computing -> Mesh generation
dc.subjectTheory of computation
dc.subjectMassively parallel algorithms
dc.subjectComputing methodologies
dc.subjectVolumetric models
dc.subjectSimulation tools
dc.subjectPhysical simulation
dc.subjectMathematics of computing
dc.subjectMesh generation
dc.titleMassively Parallel Adaptive Collapsing of Edges for Unstructured Tetrahedral Meshesen_US
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
089-099.pdf
Size:
9.03 MB
Format:
Adobe Portable Document Format
Description:
Download
Collections
High-Performance Graphics 2023 - Symposium Papers