An algorithm for two-dimensional mesh generation based on the pinwheel tiling
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2004
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866914099064995840 |
|---|---|
| author | Ganguly, Pritam Vavasis, Stephen A. Papoulia, Katerina D. |
| author_facet | Ganguly, Pritam Vavasis, Stephen A. Papoulia, Katerina D. |
| contents | We propose a new two-dimensional meshing algorithm called PINW able to generate meshes that accurately approximate the distance between any two domain points by paths composed only of cell edges. This technique is based on an extension of pinwheel tilings proposed by Radin and Conway. We prove that the algorithm produces triangles of bounded aspect ratio. This kind of mesh would be useful in cohesive interface finite element modeling when the crack propagation pathis an outcome of a simulation process. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_cs_0407018 |
| institution | arXiv |
| publishDate | 2004 |
| record_format | arxiv |
| spellingShingle | An algorithm for two-dimensional mesh generation based on the pinwheel tiling Ganguly, Pritam Vavasis, Stephen A. Papoulia, Katerina D. Computational Geometry Numerical Analysis F.2.2;G.1.8;J.2 We propose a new two-dimensional meshing algorithm called PINW able to generate meshes that accurately approximate the distance between any two domain points by paths composed only of cell edges. This technique is based on an extension of pinwheel tilings proposed by Radin and Conway. We prove that the algorithm produces triangles of bounded aspect ratio. This kind of mesh would be useful in cohesive interface finite element modeling when the crack propagation pathis an outcome of a simulation process. |
| title | An algorithm for two-dimensional mesh generation based on the pinwheel tiling |
| topic | Computational Geometry Numerical Analysis F.2.2;G.1.8;J.2 |
| url | https://arxiv.org/abs/cs/0407018 |