A weighted Delaunay triangulation framework for merging triangulations in a connectivity oblivious fashion

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

Research output: Contribution to journalArticle

Abstract

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 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 triangulations

Original languageEnglish (US)
Pages (from-to)18-30
Number of pages13
JournalComputer Graphics Forum
Volume33
Issue number6
DOIs
StatePublished - Sep 1 2014

Fingerprint

Triangulation
Merging
Computer simulation

Keywords

  • merging algorithms
  • regular triangulations
  • triangulations
  • weighted Delaunay triangulations

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

A weighted Delaunay triangulation framework for merging triangulations in a connectivity oblivious fashion. / Silva, Luis F.; Scheidegger, Luiz F.; Etiene, Tiago; Comba, João L D; Nonato, Luis G.; Silva, Cláudio T.

In: Computer Graphics Forum, Vol. 33, No. 6, 01.09.2014, p. 18-30.

Research output: Contribution to journalArticle

Silva, Luis F. ; Scheidegger, Luiz F. ; Etiene, Tiago ; Comba, João L D ; Nonato, Luis G. ; Silva, Cláudio T. / A weighted Delaunay triangulation framework for merging triangulations in a connectivity oblivious fashion. In: Computer Graphics Forum. 2014 ; Vol. 33, No. 6. pp. 18-30.
@article{8c2de9eb72514b1397a0e8c1ad01ffb4,
title = "A weighted Delaunay triangulation framework for merging triangulations in a connectivity oblivious fashion",
abstract = "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 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 triangulations",
keywords = "merging algorithms, regular triangulations, triangulations, weighted Delaunay triangulations",
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 = "2014",
month = "9",
day = "1",
doi = "10.1111/cgf.12274",
language = "English (US)",
volume = "33",
pages = "18--30",
journal = "Computer Graphics Forum",
issn = "0167-7055",
publisher = "Wiley-Blackwell",
number = "6",

}

TY - JOUR

T1 - A weighted Delaunay triangulation framework for merging triangulations in a connectivity oblivious fashion

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 - 2014/9/1

Y1 - 2014/9/1

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

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

KW - merging algorithms

KW - regular triangulations

KW - triangulations

KW - weighted Delaunay triangulations

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

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

U2 - 10.1111/cgf.12274

DO - 10.1111/cgf.12274

M3 - Article

VL - 33

SP - 18

EP - 30

JO - Computer Graphics Forum

JF - Computer Graphics Forum

SN - 0167-7055

IS - 6

ER -