3D POLYLLA: Polyhedral meshing algorithm based on terminal-edge regions and terminal-face regions
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2023
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866908293001117696 |
|---|---|
| author | Salinas-Fernández, Sergio Hitschfeld-Kahler, Nancy |
| author_facet | Salinas-Fernández, Sergio Hitschfeld-Kahler, Nancy |
| contents | Polylla is a polygonal mesh algorithm that generates meshes with arbitrarily shaped polygons using the concept of terminal-edge regions. Until now, Polylla has been limited to 2D meshes, but in this work, we extend Polylla to 3D volumetric meshes. We present two versions of Polylla 3D. The first version generates terminal-edge regions, converts them into polyhedra, and repairs polyhedra that are joined by only an edge. This version differs from the original Polylla algorithm in that it does not have the same phases as the 2D version. In the second version, we define two new concepts: longest-face propagation path and terminal-face regions. We use these concepts to create an almost direct extension of the 2D Polylla mesh with the same three phases: label phase, traversal phase, and repair phase. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2310_03665 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | 3D POLYLLA: Polyhedral meshing algorithm based on terminal-edge regions and terminal-face regions Salinas-Fernández, Sergio Hitschfeld-Kahler, Nancy Computational Geometry Polylla is a polygonal mesh algorithm that generates meshes with arbitrarily shaped polygons using the concept of terminal-edge regions. Until now, Polylla has been limited to 2D meshes, but in this work, we extend Polylla to 3D volumetric meshes. We present two versions of Polylla 3D. The first version generates terminal-edge regions, converts them into polyhedra, and repairs polyhedra that are joined by only an edge. This version differs from the original Polylla algorithm in that it does not have the same phases as the 2D version. In the second version, we define two new concepts: longest-face propagation path and terminal-face regions. We use these concepts to create an almost direct extension of the 2D Polylla mesh with the same three phases: label phase, traversal phase, and repair phase. |
| title | 3D POLYLLA: Polyhedral meshing algorithm based on terminal-edge regions and terminal-face regions |
| topic | Computational Geometry |
| url | https://arxiv.org/abs/2310.03665 |