A Robust Grid‐Based Meshing Algorithm for Embedding Self‐Intersecting Surfaces

Simple item page
dc.contributor.authorGagniere, S.en_US
dc.contributor.authorHan, Y.en_US
dc.contributor.authorChen, Y.en_US
dc.contributor.authorHyde, D.en_US
dc.contributor.authorMarquez‐Razon, A.en_US
dc.contributor.authorTeran, J.en_US
dc.contributor.authorFedkiw, R.en_US
dc.contributor.editorAlliez, Pierreen_US
dc.contributor.editorWimmer, Michaelen_US
dc.date.accessioned2024-03-23T10:14:07Z
dc.date.available2024-03-23T10:14:07Z
dc.date.issued2024
dc.description.abstractThe creation of a volumetric mesh representing the interior of an input polygonal mesh is a common requirement in graphics and computational mechanics applications. Most mesh creation techniques assume that the input surface is not self‐intersecting. However, due to numerical and/or user error, input surfaces are commonly self‐intersecting to some degree. The removal of self‐intersection is a burdensome task that complicates workflow and generally slows down the process of creating simulation‐ready digital assets. We present a method for the creation of a volumetric embedding hexahedron mesh from a self‐intersecting input triangle mesh. Our method is designed for efficiency by minimizing use of computationally expensive exact/adaptive precision arithmetic. Although our approach allows for nearly no limit on the degree of self‐intersection in the input surface, our focus is on efficiency in the most common case: many minimal self‐intersections. The embedding hexahedron mesh is created from a uniform background grid and consists of hexahedron elements that are geometrical copies of grid cells. Multiple copies of a single grid cell are used to resolve regions of self‐intersection/overlap. Lastly, we develop a novel topology‐aware embedding mesh coarsening technique to allow for user‐specified mesh resolution as well as a topology‐aware tetrahedralization of the hexahedron mesh.en_US
dc.description.number1
dc.description.sectionheadersARTICLES
dc.description.seriesinformationComputer Graphics Forum
dc.description.volume43
dc.identifier.doi10.1111/cgf.14986
dc.identifier.issn1467-8659
dc.identifier.pages17 pages
dc.identifier.urihttps://doi.org/10.1111/cgf.14986
dc.identifier.urihttps://diglib.eg.org/handle/10.1111/cgf14986
dc.publisher© 2024 Eurographics ‐ The European Association for Computer Graphics and John Wiley & Sons Ltd.en_US
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 International
dc.rights.urihttps://creativecommons.org/licenses/by-nc-nd/4.0/
dc.subjectmesh generation
dc.subjectmodelling
dc.titleA Robust Grid‐Based Meshing Algorithm for Embedding Self‐Intersecting Surfacesen_US
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
v43i1_01_cgf14986.pdf
Size:
7.65 MB
Format:
Adobe Portable Document Format
Download
Collections
43-Issue 1