Identity statement area | |
Reference Type | Conference Paper (Conference Proceedings) |
Site | sibgrapi.sid.inpe.br |
Identifier | 8JMKD3MGPBW34M/3CADAAE |
Repository | sid.inpe.br/sibgrapi/2012/07.18.13.41 |
Last Update | 2012:07.18.13.41.27 joao.comba@gmail.com |
Metadata | sid.inpe.br/sibgrapi/2012/07.18.13.41.27 |
Metadata Last Update | 2020:02.19.02.18.29 administrator |
Citation Key | SilvaScEtCoNoSi:2012:CoObMe |
Title | Connectivity Oblivious Merging of Triangulations  |
Format | DVD, On-line. |
Year | 2012 |
Access Date | 2021, Jan. 28 |
Number of Files | 1 |
Size | 2488 KiB |
Context area | |
Author | 1 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. |
Affiliation | 1 UFRGS 2 UFRGS 3 University of Utah 4 UFRGS 5 ICMC-USP 6 Poly-NYU |
Editor | Freitas, Carla Maria Dal Sasso Sarkar, Sudeep Scopigno, Roberto Silva, Luciano |
e-Mail Address | joao.comba@gmail.com |
Conference Name | Conference on Graphics, Patterns and Images, 25 (SIBGRAPI) |
Conference Location | Ouro Preto |
Date | Aug. 22-25, 2012 |
Book Title | Proceedings |
Publisher | IEEE Computer Society |
Publisher City | Los Alamitos |
Tertiary Type | Full Paper |
History | 2012-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 Stage | completed |
Transferable | 1 |
Content Type | External Contribution |
Keywords | Power diagram, Weighted Delaunay, 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. |
source Directory Content | there are no files |
agreement Directory Content | |
Conditions of access and use area | |
data URL | http://urlib.net/rep/8JMKD3MGPBW34M/3CADAAE |
zipped data URL | http://urlib.net/zip/8JMKD3MGPBW34M/3CADAAE |
Language | en |
Target File | dmrt-small.pdf |
User Group | joao.comba@gmail.com |
Visibility | shown |
Allied materials area | |
Mirror Repository | sid.inpe.br/banon/2001/03.30.15.38.24 |
Host Collection | sid.inpe.br/banon/2001/03.30.15.38 |
Notes area | |
Empty Fields | accessionnumber 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 |
| |