Close
Metadata

1. Identity statement
Reference TypeConference Paper (Conference Proceedings)
Sitesibgrapi.sid.inpe.br
Holder Codeibi 8JMKD3MGPEW34M/46T9EHH
Identifier8JMKD3MGPBW34M/3CADAAE
Repositorysid.inpe.br/sibgrapi/2012/07.18.13.41
Last Update2012:07.18.13.41.27 (UTC) administrator
Metadata Repositorysid.inpe.br/sibgrapi/2012/07.18.13.41.27
Metadata Last Update2022:06.14.00.07.39 (UTC) administrator
DOI10.1109/SIBGRAPI.2012.25
Citation KeySilvaScEtCoNoSi:2012:CoObMe
TitleConnectivity Oblivious Merging of Triangulations
FormatDVD, On-line.
Year2012
Access Date2025, Mar. 21
Number of Files1
Size2488 KiB
2. Context
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, MG, Brazil
Date22-25 Aug. 2012
PublisherIEEE Computer Society
Publisher CityLos Alamitos
Book TitleProceedings
Tertiary TypeFull Paper
History (UTC)2012-09-20 16:45:34 :: joao.comba@gmail.com -> administrator :: 2012
2022-03-08 21:03:25 :: administrator -> menottid@gmail.com :: 2012
2022-03-10 13:04:41 :: menottid@gmail.com -> administrator :: 2012
2022-06-14 00:07:39 :: administrator -> :: 2012
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Version Typefinaldraft
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.
Arrangement 1urlib.net > SDLA > Fonds > SIBGRAPI 2012 > Connectivity Oblivious Merging...
Arrangement 2urlib.net > SDLA > Fonds > Full Index > Connectivity Oblivious Merging...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Content
agreement.html 18/07/2012 10:41 0.7 KiB 
4. Conditions of access and use
data URLhttp://urlib.net/ibi/8JMKD3MGPBW34M/3CADAAE
zipped data URLhttp://urlib.net/zip/8JMKD3MGPBW34M/3CADAAE
Languageen
Target Filedmrt-small.pdf
User Groupjoao.comba@gmail.com
Visibilityshown
5. Allied materials
Mirror Repositorysid.inpe.br/banon/2001/03.30.15.38.24
Next Higher Units8JMKD3MGPEW34M/46SL8GS
8JMKD3MGPEW34M/4742MCS
Citing Item Listsid.inpe.br/sibgrapi/2022/05.15.03.31 34
sid.inpe.br/sibgrapi/2022/06.10.21.49 5
sid.inpe.br/banon/2001/03.30.15.38.24 3
Host Collectionsid.inpe.br/banon/2001/03.30.15.38
6. Notes
Empty Fieldsarchivingpolicy archivist area callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination documentstage edition electronicmailaddress group isbn issn label lineage mark nextedition notes numberofvolumes orcid organization pages parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url volume


Close