A Weighted Delaunay Triangulation Framework for Merging Triangulations in a Connectivity Oblivious Fashion
| dc.contributor.author | Silva, Luis F. | en_US |
| dc.contributor.author | Scheidegger, Luiz F. | en_US |
| dc.contributor.author | Etiene, Tiago | en_US |
| dc.contributor.author | Comba, João L. D. | en_US |
| dc.contributor.author | Nonato, Luis G. | en_US |
| dc.contributor.author | Silva, Cláudio T. | en_US |
| dc.contributor.editor | Oliver Deussen and Hao (Richard) Zhang | en_US |
| dc.date.accessioned | 2015-03-03T12:44:08Z | |
| dc.date.available | 2015-03-03T12:44:08Z | |
| dc.date.issued | 2014 | en_US |
| dc.description.abstract | Simplicial meshes are useful as discrete approximations of continuous spaces in numerical simulations. In some applications, however, meshes need to be modified over time. Mesh update operations are often expensive and brittle, making the simulations unstable. In this paper we propose a framework for updating simplicial meshes that undergo geometric and topological changes. Instead of explicitly maintaining connectivity information, we keep a collection of weights associated with mesh vertices, using a Weighted Delaunay Triangulation (WDT). These weights implicitly define mesh connectivity and allow direct merging of triangulations. We propose two formulations for computing the weights, and two techniques for merging triangulations, and finally illustrate our results with examples in two and three dimensions.Simplicial meshes are useful as discrete approximations of continuous spaces in numerical simulations. In some applications, however, meshes need to be modified over time. Mesh update operations are often expensive and brittle, making the simulations unstable. In this paper we propose a framework for updating simplicial meshes that undergo geometric and topological changes. Instead of explicitly maintaining connectivity information, we keep a collection of weights associated with mesh vertices, using a Weighted Delaunay Triangulation (WDT). These weights implicitly define mesh connectivity and allow direct merging of triangulations | en_US |
| dc.description.number | 6 | |
| dc.description.seriesinformation | Computer Graphics Forum | en_US |
| dc.description.volume | 33 | |
| dc.identifier.doi | 10.1111/cgf.12274 | en_US |
| dc.identifier.issn | 1467-8659 | en_US |
| dc.identifier.uri | https://doi.org/10.1111/cgf.12274 | en_US |
| dc.publisher | The Eurographics Association and John Wiley and Sons Ltd. | en_US |
| dc.title | A Weighted Delaunay Triangulation Framework for Merging Triangulations in a Connectivity Oblivious Fashion | en_US |