Hexahedral Mesh Repair via Sum‐of‐Squares Relaxation
© 2020 The Author(s) Computer Graphics Forum © 2020 The Eurographics Association and John Wiley & Sons Ltd. Published by John Wiley & Sons Ltd. The validity of trilinear hexahedral (hex) mesh elements is a prerequisite for many applications of hex meshes, such as finite element analysis....
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021
|
| Online Access: | https://hdl.handle.net/1721.1/135481 |
| _version_ | 1826204996570447872 |
|---|---|
| author | Marschner, Z Palmer, D Zhang, P Solomon, J |
| author2 | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
| author_facet | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Marschner, Z Palmer, D Zhang, P Solomon, J |
| author_sort | Marschner, Z |
| collection | MIT |
| description | © 2020 The Author(s) Computer Graphics Forum © 2020 The Eurographics Association and John Wiley & Sons Ltd. Published by John Wiley & Sons Ltd. The validity of trilinear hexahedral (hex) mesh elements is a prerequisite for many applications of hex meshes, such as finite element analysis. A commonly used check for hex mesh validity evaluates mesh quality on the corners of the parameter domain of each hex, an insufficient condition that neglects invalidity elsewhere in the element, but is straightforward to compute. Hex mesh quality optimizations using this validity criterion suffer by being unable to detect invalidities in a hex mesh reliably, let alone fix them. We rectify these challenges by leveraging sum-of-squares relaxations to pinpoint invalidities in a hex mesh efficiently and robustly. Furthermore, we design a hex mesh repair algorithm that can certify validity of the entire hex mesh. We demonstrate our hex mesh repair algorithm on a dataset of meshes that include hexes with both corner and face-interior invalidities and demonstrate that where naïve algorithms would fail to even detect invalidities, we are able to repair them. Our novel methodology also introduces the general machinery of sum-of-squares relaxation to geometry processing, where it has the potential to solve related problems. |
| first_indexed | 2024-09-23T13:05:07Z |
| format | Article |
| id | mit-1721.1/135481 |
| institution | Massachusetts Institute of Technology |
| language | English |
| last_indexed | 2024-09-23T13:05:07Z |
| publishDate | 2021 |
| publisher | Wiley |
| record_format | dspace |
| spelling | mit-1721.1/1354812023-09-14T19:42:34Z Hexahedral Mesh Repair via Sum‐of‐Squares Relaxation Marschner, Z Palmer, D Zhang, P Solomon, J Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory © 2020 The Author(s) Computer Graphics Forum © 2020 The Eurographics Association and John Wiley & Sons Ltd. Published by John Wiley & Sons Ltd. The validity of trilinear hexahedral (hex) mesh elements is a prerequisite for many applications of hex meshes, such as finite element analysis. A commonly used check for hex mesh validity evaluates mesh quality on the corners of the parameter domain of each hex, an insufficient condition that neglects invalidity elsewhere in the element, but is straightforward to compute. Hex mesh quality optimizations using this validity criterion suffer by being unable to detect invalidities in a hex mesh reliably, let alone fix them. We rectify these challenges by leveraging sum-of-squares relaxations to pinpoint invalidities in a hex mesh efficiently and robustly. Furthermore, we design a hex mesh repair algorithm that can certify validity of the entire hex mesh. We demonstrate our hex mesh repair algorithm on a dataset of meshes that include hexes with both corner and face-interior invalidities and demonstrate that where naïve algorithms would fail to even detect invalidities, we are able to repair them. Our novel methodology also introduces the general machinery of sum-of-squares relaxation to geometry processing, where it has the potential to solve related problems. 2021-10-27T20:23:38Z 2021-10-27T20:23:38Z 2020 2021-01-26T18:08:55Z Article http://purl.org/eprint/type/JournalArticle https://hdl.handle.net/1721.1/135481 en 10.1111/CGF.14074 Computer Graphics Forum Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/ application/pdf Wiley MIT web domain |
| spellingShingle | Marschner, Z Palmer, D Zhang, P Solomon, J Hexahedral Mesh Repair via Sum‐of‐Squares Relaxation |
| title | Hexahedral Mesh Repair via Sum‐of‐Squares Relaxation |
| title_full | Hexahedral Mesh Repair via Sum‐of‐Squares Relaxation |
| title_fullStr | Hexahedral Mesh Repair via Sum‐of‐Squares Relaxation |
| title_full_unstemmed | Hexahedral Mesh Repair via Sum‐of‐Squares Relaxation |
| title_short | Hexahedral Mesh Repair via Sum‐of‐Squares Relaxation |
| title_sort | hexahedral mesh repair via sum of squares relaxation |
| url | https://hdl.handle.net/1721.1/135481 |
| work_keys_str_mv | AT marschnerz hexahedralmeshrepairviasumofsquaresrelaxation AT palmerd hexahedralmeshrepairviasumofsquaresrelaxation AT zhangp hexahedralmeshrepairviasumofsquaresrelaxation AT solomonj hexahedralmeshrepairviasumofsquaresrelaxation |