Show simple item record

dc.contributor.authorSilva, Luis F.en_US
dc.contributor.authorScheidegger, Luiz F.en_US
dc.contributor.authorEtiene, Tiagoen_US
dc.contributor.authorComba, João L. D.en_US
dc.contributor.authorNonato, Luis G.en_US
dc.contributor.authorSilva, Cláudio T.en_US
dc.contributor.editorOliver Deussen and Hao (Richard) Zhangen_US
dc.date.accessioned2015-03-03T12:44:08Z
dc.date.available2015-03-03T12:44:08Z
dc.date.issued2014en_US
dc.identifier.issn1467-8659en_US
dc.identifier.urihttp://dx.doi.org/10.1111/cgf.12274en_US
dc.description.abstractSimplicial 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 triangulationsen_US
dc.publisherThe Eurographics Association and John Wiley and Sons Ltd.en_US
dc.titleA Weighted Delaunay Triangulation Framework for Merging Triangulations in a Connectivity Oblivious Fashionen_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume33
dc.description.number6


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record