author = "Choque, Tony L. and Cuadros, Alex J.",
          affiliation = "{Universidad Cat{\'o}lica San Pablo} and {Universidad 
                         Cat{\'o}lica San Pablo}",
                title = "Repairing Non-manifold Boundaries of Segmented Simplicial Meshes",
            booktitle = "Proceedings...",
                 year = "2017",
               editor = "Torchelsen, Rafael Piccin and Nascimento, Erickson Rangel do and 
                         Panozzo, Daniele and Liu, Zicheng and Farias, Myl{\`e}ne and 
                         Viera, Thales and Sacht, Leonardo and Ferreira, Nivan and Comba, 
                         Jo{\~a}o Luiz Dihl and Hirata, Nina and Schiavon Porto, Marcelo 
                         and Vital, Creto and Pagot, Christian Azambuja and Petronetto, 
                         Fabiano and Clua, Esteban and Cardeal, Fl{\'a}vio",
         organization = "Conference on Graphics, Patterns and Images, 30. (SIBGRAPI)",
            publisher = "IEEE Computer Society",
              address = "Los Alamitos",
             keywords = "Computational Geometry, Computer Graphics, Manifold.",
             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.",
  conference-location = "Niter{\'o}i, RJ",
      conference-year = "Oct. 17-20, 2017",
             language = "en",
           targetfile = "143.pdf",
        urlaccessdate = "2021, Jan. 21"