Connectivity Oblivious Merging of Triangulations

Luis F. Silva, Luiz F. Scheidegger, Tiago Etiene, Joao L. D. Comba, Luis G. Nonato, Claudio T. Silva
2012 2012 25th SIBGRAPI Conference on Graphics, Patterns and Images  
Fig. 1 : Merging a buddha tetrahedral mesh with a background grid. Our technique is able to handle meshes with distinct levels of refinement -observe how the internal tetrahedra of the buddha have not been refined. Abstract-Simplicial meshes are extremely 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, which tends to make the numerical
more » ... lations unstable. In this paper we propose an alternative technique for updating simplicial meshes that undergo geometric and topological changes. We exploit the property that a Weighted Delaunay Triangulation (WDT) can be used to implicitly define the connectivity of a mesh. Instead of explicitly maintaining connectivity information, we simply keep a collection of weights associated with each vertex. This approach allows for a simple way to merge triangulations, which we illustrate with examples in 2D and 3D.
doi:10.1109/sibgrapi.2012.25 dblp:conf/sibgrapi/SilvaSECNS12 fatcat:svyq46mh7fegpcyjypwgkc7svm