Connectivity oblivious merging of triangulations

Luis F. Silva, Luiz F. Scheidegger, Tiago Etiene, João L D Comba, Luis G. Nonato, Cláudio T. Silva

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publicationProceedings - 25th SIBGRAPI: Conference on Graphics, Patterns and Images, SIBGRAPI 2012
Pages118-125
Number of pages8
DOIs
StatePublished - 2012
Event25th Conference on Graphics, Patterns and Images, SIBGRAPI 2012 - Ouro Preto, Brazil
Duration: Aug 22 2012Aug 25 2012

Other

Other25th Conference on Graphics, Patterns and Images, SIBGRAPI 2012
CountryBrazil
CityOuro Preto
Period8/22/128/25/12

Fingerprint

Triangulation
Merging
Computer simulation

Keywords

  • Power diagram
  • Triangulations
  • Weighted Delaunay

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Signal Processing
  • Software

Cite this

Silva, L. F., Scheidegger, L. F., Etiene, T., Comba, J. L. D., Nonato, L. G., & Silva, C. T. (2012). Connectivity oblivious merging of triangulations. In Proceedings - 25th SIBGRAPI: Conference on Graphics, Patterns and Images, SIBGRAPI 2012 (pp. 118-125). [6382747] https://doi.org/10.1109/SIBGRAPI.2012.25

Connectivity oblivious merging of triangulations. / Silva, Luis F.; Scheidegger, Luiz F.; Etiene, Tiago; Comba, João L D; Nonato, Luis G.; Silva, Cláudio T.

Proceedings - 25th SIBGRAPI: Conference on Graphics, Patterns and Images, SIBGRAPI 2012. 2012. p. 118-125 6382747.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Silva, LF, Scheidegger, LF, Etiene, T, Comba, JLD, Nonato, LG & Silva, CT 2012, Connectivity oblivious merging of triangulations. in Proceedings - 25th SIBGRAPI: Conference on Graphics, Patterns and Images, SIBGRAPI 2012., 6382747, pp. 118-125, 25th Conference on Graphics, Patterns and Images, SIBGRAPI 2012, Ouro Preto, Brazil, 8/22/12. https://doi.org/10.1109/SIBGRAPI.2012.25
Silva LF, Scheidegger LF, Etiene T, Comba JLD, Nonato LG, Silva CT. Connectivity oblivious merging of triangulations. In Proceedings - 25th SIBGRAPI: Conference on Graphics, Patterns and Images, SIBGRAPI 2012. 2012. p. 118-125. 6382747 https://doi.org/10.1109/SIBGRAPI.2012.25
Silva, Luis F. ; Scheidegger, Luiz F. ; Etiene, Tiago ; Comba, João L D ; Nonato, Luis G. ; Silva, Cláudio T. / Connectivity oblivious merging of triangulations. Proceedings - 25th SIBGRAPI: Conference on Graphics, Patterns and Images, SIBGRAPI 2012. 2012. pp. 118-125
@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.}",
year = "2012",
doi = "10.1109/SIBGRAPI.2012.25",
language = "English (US)",
isbn = "9780769548296",
pages = "118--125",
booktitle = "Proceedings - 25th SIBGRAPI: Conference on Graphics, Patterns and Images, SIBGRAPI 2012",

}

TY - GEN

T1 - Connectivity oblivious merging of triangulations

AU - Silva, Luis F.

AU - Scheidegger, Luiz F.

AU - Etiene, Tiago

AU - Comba, João L D

AU - Nonato, Luis G.

AU - Silva, Cláudio T.

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

KW - Power diagram

KW - Triangulations

KW - Weighted Delaunay

UR - http://www.scopus.com/inward/record.url?scp=84872383086&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84872383086&partnerID=8YFLogxK

U2 - 10.1109/SIBGRAPI.2012.25

DO - 10.1109/SIBGRAPI.2012.25

M3 - Conference contribution

AN - SCOPUS:84872383086

SN - 9780769548296

SP - 118

EP - 125

BT - Proceedings - 25th SIBGRAPI: Conference on Graphics, Patterns and Images, SIBGRAPI 2012

ER -