The Community for Technology Leaders
Green Image
Issue No. 02 - Feb. (2013 vol. 19)
ISSN: 1077-2626
pp: 306-318
Min Wan , Div. of Math. Sci., Nanyang Technol. Univ., Singapore, Singapore
Yu Wang , CGGVeritas Co., Singapore, Singapore
E. Bae , Dept. of Math., Univ. of Bergen, Bergen, Norway
Xue-Cheng Tai , Div. of Math. Sci., Nanyang Technol. Univ., Singapore, Singapore
Desheng Wang , Div. of Math. Sci., Nanyang Technol. Univ., Singapore, Singapore
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.
mesh generation, Boolean functions, computer graphics, graph theory, watertight surfaces, graph-cuts-based method, unordered point sets, Boolean operation, open surface problem, Delaunay-based tetrahedral mesh, multiphase technique, domain decomposition, open surface reconstruction method, open nonorientable surfaces, Surface reconstruction, Level set, Surface cracks, Surface treatment, Reconstruction algorithms, Minimization, Robustness, Delaunay triangulation, Graph cuts, open surface, domain decomposition

Yu Wang, Desheng Wang, E. Bae, Min Wan and Xue-Cheng Tai, "Reconstructing Open Surfaces via Graph-Cuts," in IEEE Transactions on Visualization & Computer Graphics, vol. 19, no. , pp. 306-318, 2013.
182 ms
(Ver 3.3 (11022016))