@inproceedings{335f0dc468334dcbacd2da6fb14dfb97,
title = "Connectivity oblivious merging of triangulations",
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 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.",
keywords = "Power diagram, Triangulations, Weighted Delaunay",
author = "Silva, {Luis F.} and Scheidegger, {Luiz F.} and Tiago Etiene and Comba, {Jo{\~a}o L D} and Nonato, {Luis G.} and Silva, {Cl{\'a}udio T.}",
note = "Copyright: Copyright 2013 Elsevier B.V., All rights reserved.; 25th Conference on Graphics, Patterns and Images, SIBGRAPI 2012 ; Conference date: 22-08-2012 Through 25-08-2012",
year = "2012",
doi = "10.1109/SIBGRAPI.2012.25",
language = "English (US)",
isbn = "9780769548296",
series = "Brazilian Symposium of Computer Graphic and Image Processing",
pages = "118--125",
booktitle = "Proceedings - 25th SIBGRAPI",
}