Reconstructing Open Surfaces via Graph-Cuts

Authors:
Min Wan;Yu Wang;Egil Bae;Xue-Cheng Tai;Desheng Wang
Affiliations:
Nanyang Technological University, Singapore;Nanyang Technological University, Singapore;University of Bergen, Brunsgate;Nanyang Technological University, Singapore and University of Bergen, Brunsgate;Nanyang Technological University, Singapore
Venue:
IEEE Transactions on Visualization and Computer Graphics
Year:
2013

Citing 0
Cited 2

Robust inside-outside segmentation using generalized winding numbers

ACM Transactions on Graphics (TOG) - SIGGRAPH 2013 Conference Proceedings
A Splitting Algorithm for Image Segmentation on Manifolds Represented by the Grid Based Particle Method

Journal of Scientific Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A novel graph-cuts-based method is proposed for reconstructing open surfaces from unordered point sets. Through a Boolean operation on the crust around the data set, the open surface problem is translated to a watertight surface problem within a restricted region. Integrating the variational model, Delaunay-based tetrahedral mesh and multiphase technique, the proposed method can reconstruct open surfaces robustly and effectively. Furthermore, a surface reconstruction method with domain decomposition is presented, which is based on the new open surface reconstruction method. This method can handle more general surfaces, such as nonorientable surfaces. The algorithm is designed in a parallel-friendly way and necessary measures are taken to eliminate cracks and conflicts between the subdomains. Numerical examples are included to demonstrate the robustness and effectiveness of the proposed method on watertight, open orientable, open nonorientable surfaces and combinations of such.