Identity statement area
Reference TypeConference Paper (Conference Proceedings)
Last Update2017: administrator
Metadata Last Update2020: administrator
Citation KeyChoqueCuad:2017:ReNoBo
TitleRepairing Non-manifold Boundaries of Segmented Simplicial Meshes
DateOct. 17-20, 2017
Access Date2021, Jan. 21
Number of Files1
Size29166 KiB
Context area
Author1 Choque, Tony L.
2 Cuadros, Alex J.
Affiliation1 Universidad Católica San Pablo
2 Universidad Católica San Pablo
EditorTorchelsen, Rafael Piccin
Nascimento, Erickson Rangel do
Panozzo, Daniele
Liu, Zicheng
Farias, Mylène
Viera, Thales
Sacht, Leonardo
Ferreira, Nivan
Comba, João Luiz Dihl
Hirata, Nina
Schiavon Porto, Marcelo
Vital, Creto
Pagot, Christian Azambuja
Petronetto, Fabiano
Clua, Esteban
Cardeal, Flávio
Conference NameConference on Graphics, Patterns and Images, 30 (SIBGRAPI)
Conference LocationNiterói, RJ
Book TitleProceedings
PublisherIEEE Computer Society
Publisher CityLos Alamitos
Tertiary TypeFull Paper
History2017-08-22 03:04:13 :: -> administrator ::
2020-02-19 02:01:41 :: administrator -> :: 2017
Content and structure area
Is the master or a copy?is the master
Content Stagecompleted
Content TypeExternal Contribution
KeywordsComputational Geometry, Computer Graphics, Manifold.
AbstractA digital image may contain objects that can be made up of multiple regions concerning different material properties, physical or chemical attributes. Thus, segmented simplicial meshes with non-manifold boundaries are generated to represent the partitioned regions. We focus on repairing non-manifold boundaries. Current methods modify the topology, geometry or both, using their own data structures. The problem of modifying the topology is that if the mesh has to be post-processed, for instance with the Delaunay refinement, the mesh becomes unsuitable. In this paper, we propose alternatives to repair non-manifold boundaries of segmented simplicial meshes, among them is the Delaunay based one, we use common data structures and only consider 2 and 3 dimensions. We developed algorithms for this purpose, composed of the following tools: relabeling, point insertion and simulated annealing. These algorithms are applied depending on the targeted contexts, if we want to speed the process, keep as possible the original segmented mesh or keep the number of elements in the mesh.
source Directory Contentthere are no files
agreement Directory Content
agreement.html 22/08/2017 00:04 1.2 KiB 
Conditions of access and use area
data URL
zipped data URL
Target File143.pdf
Update Permissionnot transferred
Allied materials area
Next Higher Units8JMKD3MGPAW/3PJT9LS
Notes area
Empty Fieldsaccessionnumber archivingpolicy archivist area callnumber copyholder copyright creatorhistory descriptionlevel dissemination doi edition electronicmailaddress group holdercode isbn issn label lineage mark nextedition 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