`%0 Conference Proceedings`

`%4 sid.inpe.br/sibgrapi/2012/07.18.13.41`

`%2 sid.inpe.br/sibgrapi/2012/07.18.13.41.27`

`%T Connectivity Oblivious Merging of Triangulations`

`%D 2012`

`%A Silva, Luis F.,`

`%A Scheidegger, Luiz F.,`

`%A Etiene, Tiago,`

`%A Comba, Joćo L. D.,`

`%A Nonato, Luis G.,`

`%A Silva, Clįudio T.,`

`%@affiliation UFRGS`

`%@affiliation UFRGS`

`%@affiliation University of Utah`

`%@affiliation UFRGS`

`%@affiliation ICMC-USP`

`%@affiliation Poly-NYU`

`%E Freitas, Carla Maria Dal Sasso,`

`%E Sarkar, Sudeep,`

`%E Scopigno, Roberto,`

`%E Silva, Luciano,`

`%B Conference on Graphics, Patterns and Images, 25 (SIBGRAPI)`

`%C Ouro Preto`

`%8 Aug. 22-25, 2012`

`%S Proceedings`

`%I IEEE Computer Society`

`%J Los Alamitos`

`%K Power diagram, Weighted Delaunay, Triangulations.`

`%X 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 simulations 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.`

`%@language en`

`%3 dmrt-small.pdf`