Mi DSpace
Please use this identifier to cite or link to this item: http://hdl.handle.net/UCSP/15776
Title: Repairing Non-Manifold Boundaries of Segmented Simplicial Meshes
Authors: Choque Ramos, Tony Liedyn
Cuadros Vargas, Alex Jesus
Keywords: Computational geometry;Computer graphics;Data structures;Repair;Simulated annealing;Topology;3-dimension;Chemical attributes;Delaunay refinements;Digital image;Manifold;Multiple regions;Non-manifolds;Point insertions;Mesh generation
Issue Date: 2017
Publisher: Institute of Electrical and Electronics Engineers Inc.
metadata.dc.relation.uri: https://www.scopus.com/inward/record.uri?eid=2-s2.0-85040608101&doi=10.1109%2fSIBGRAPI.2017.12&partnerID=40&md5=7626754d0019f6fb4ee736e3c5906810
Abstract: A 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. © 2017 IEEE.
URI: http://repositorio.ucsp.edu.pe/handle/UCSP/15776
ISBN: 9781538622193
Appears in Collections:Artículos de investigación

Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.