Close
Metadata

Identity statement area
Reference TypeConference Paper (Conference Proceedings)
Sitesibgrapi.sid.inpe.br
Identifier8JMKD3MGPBW34M/3CADAAE
Repositorysid.inpe.br/sibgrapi/2012/07.18.13.41
Last Update2012:07.18.13.41.27 joao.comba@gmail.com
Metadatasid.inpe.br/sibgrapi/2012/07.18.13.41.27
Metadata Last Update2020:02.19.02.18.29 administrator
Citation KeySilvaScEtCoNoSi:2012:CoObMe
TitleConnectivity Oblivious Merging of Triangulations
FormatDVD, On-line.
Year2012
Access Date2021, Jan. 28
Number of Files1
Size2488 KiB
Context area
Author1 Silva, Luis F.
2 Scheidegger, Luiz F.
3 Etiene, Tiago
4 Comba, Joćo L. D.
5 Nonato, Luis G.
6 Silva, Clįudio T.
Affiliation1 UFRGS
2 UFRGS
3 University of Utah
4 UFRGS
5 ICMC-USP
6 Poly-NYU
EditorFreitas, Carla Maria Dal Sasso
Sarkar, Sudeep
Scopigno, Roberto
Silva, Luciano
e-Mail Addressjoao.comba@gmail.com
Conference NameConference on Graphics, Patterns and Images, 25 (SIBGRAPI)
Conference LocationOuro Preto
DateAug. 22-25, 2012
Book TitleProceedings
PublisherIEEE Computer Society
Publisher CityLos Alamitos
Tertiary TypeFull Paper
History2012-09-20 16:45:34 :: joao.comba@gmail.com -> administrator :: 2012
2020-02-19 02:18:29 :: administrator -> :: 2012
Content and structure area
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Content TypeExternal Contribution
KeywordsPower diagram, Weighted Delaunay, Triangulations.
AbstractSimplicial 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.
source Directory Contentthere are no files
agreement Directory Content
agreement.html 18/07/2012 10:41 0.7 KiB 
Conditions of access and use area
data URLhttp://urlib.net/rep/8JMKD3MGPBW34M/3CADAAE
zipped data URLhttp://urlib.net/zip/8JMKD3MGPBW34M/3CADAAE
Languageen
Target Filedmrt-small.pdf
User Groupjoao.comba@gmail.com
Visibilityshown
Allied materials area
Mirror Repositorysid.inpe.br/banon/2001/03.30.15.38.24
Host Collectionsid.inpe.br/banon/2001/03.30.15.38
Notes area
Empty Fieldsaccessionnumber archivingpolicy archivist area callnumber copyholder copyright creatorhistory descriptionlevel dissemination documentstage doi edition electronicmailaddress group holdercode isbn issn label lineage mark nextedition nexthigherunit notes numberofvolumes orcid organization pages parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url versiontype volume

Close