Solid Geometry Processing on Deconstructed Domains
| dc.contributor.author | Sellán, Silvia | en_US |
| dc.contributor.author | Cheng, Herng Yi | en_US |
| dc.contributor.author | Ma, Yuming | en_US |
| dc.contributor.author | Dembowski, Mitchell | en_US |
| dc.contributor.author | Jacobson, Alec | en_US |
| dc.contributor.editor | Chen, Min and Benes, Bedrich | en_US |
| dc.date.accessioned | 2019-03-17T09:57:04Z | |
| dc.date.available | 2019-03-17T09:57:04Z | |
| dc.date.issued | 2019 | |
| dc.description.abstract | Many tasks in geometry processing are modelled as variational problems solved numerically using the finite element method. For solid shapes, this requires a volumetric discretization, such as a boundary conforming tetrahedral mesh. Unfortunately, tetrahedral meshing remains an open challenge and existing methods either struggle to conform to complex boundary surfaces or require manual intervention to prevent failure. Rather than create a single volumetric mesh for the entire shape, we advocate for solid geometry processing on , where a large and complex shape is composed of overlapping solid subdomains. As each smaller and simpler part is now easier to tetrahedralize, the question becomes how to account for overlaps during problem modelling and how to couple solutions on each subdomain together . We explore how and why previous coupling methods fail, and propose a method that couples solid domains only along their boundary surfaces. We demonstrate the superiority of this method through empirical convergence tests and qualitative applications to solid geometry processing on a variety of popular second‐order and fourth‐order partial differential equations.Many tasks in geometry processing are modelled as variational problems solved numerically using the finite element method. For solid shapes, this requires a volumetric discretization, such as a boundary conforming tetrahedral mesh. Unfortunately, tetrahedral meshing remains an open challenge and existing methods either struggle to conform to complex boundary surfaces or require manual intervention to prevent failure. Rather than create a single volumetric mesh for the entire shape, we advocate for solid geometry processing on , where a large and complex shape is composed of overlapping solid subdomains. As each smaller and simpler part is now easier to tetrahedralize, the question becomes how to account for overlaps during problem modelling and how to couple solutions on each subdomain together . We explore how and why previous coupling methods fail, and propose a method that couples solid domains only along their boundary surfaces. We demonstrate the superiority of this method through empirical convergence tests and qualitative applications to solid geometry processing on a variety of popular second‐order and fourth‐order partial differential equations. | en_US |
| dc.description.number | 1 | |
| dc.description.sectionheaders | Articles | |
| dc.description.seriesinformation | Computer Graphics Forum | |
| dc.description.volume | 38 | |
| dc.identifier.doi | 10.1111/cgf.13592 | |
| dc.identifier.issn | 1467-8659 | |
| dc.identifier.pages | 564-579 | |
| dc.identifier.uri | https://doi.org/10.1111/cgf.13592 | |
| dc.identifier.uri | https://diglib.eg.org:443/handle/10.1111/cgf13592 | |
| dc.publisher | © 2019 The Eurographics Association and John Wiley & Sons Ltd. | en_US |
| dc.subject | numerical analysis | |
| dc.subject | methods and applications | |
| dc.subject | • Mathematics of computing → Discretization; Partial differential equations; Numerical differentiation | |
| dc.title | Solid Geometry Processing on Deconstructed Domains | en_US |