Variational surface reconstruction based on Delaunay triangulation and graph cut

International Journal for Numerical Methods in Engineering

Volumn 85, Issue 2, 2011, Pages 206-229

  Wan, Min ^a   Wang, Yu ^a   Wang, Desheng ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

Delaunay triangulation; Graph cut; Multi phase; Reverse engineering; Surface reconstruction

Indexed keywords

DELAUNAY; DELAUNAY TRIANGULATION; ENERGY FUNCTIONALS; GRAPH CUT; HOMEOMORPHIC; IMPLICIT METHODS; MINIMIZATION PROBLEMS; MULTI-PHASE; NONUNIFORMITY; NOVEL METHODS; SAMPLING DENSITIES; TETRAHEDRAL MESHES; TOPOLOGICAL COMPLEXITY; TRIANGULAR SURFACE MESHES; UNDER-SAMPLING; UNORGANIZED POINTS; WEIGHTED MINIMAL SURFACES;

GRAPHIC METHODS; REVERSE ENGINEERING; TOPOLOGY; TRIANGULATION;

SURFACE RECONSTRUCTION;

EID: 78650539277     PISSN: 00295981     EISSN: 10970207     Source Type: Journal    
DOI: 10.1002/nme.2965     Document Type: Article

References (45)

1. Edelsbrunner H, Mucke E. Three-dimensional alpha shapes. Proceedings of the 1992 Workshop on Volume Visualization. ACM:New York, NY, U.S.A., 1992; 75-82.
2. Amenta N, Bern M. Surface reconstruction by Voronoi filtering. Discrete and Computational Geometry 1999; 22(4):481-504.
3. Amenta N, Bern M, Kamvysselis M. A new Voronoi-based surface reconstruction algorithm. Proceedings of the 25th Annual Conference on Computer Graphics and Interactive Techniques. ACM: New York, NY, U.S.A., 1998; 415-421.
4. Amenta N, Choi S, Dey T, Leekha N. A simple algorithm for homeomorphic surface reconstruction. Proceedings of the 16th Annual Symposium on Computational Geometry. ACM: New York, NY, U.S.A., 2000; 213-222.
5. Adamy U, Giesen J, John M. New techniques for topologically correct surface reconstruction. Proceedings of the Conference on Visualization'00. IEEE Computer Society Press: Los Alamitos, CA, U.S.A., 2000; 373-380.
6. Boissonnat J, Cazals F. Smooth surface reconstruction via natural neighbour interpolation of distance functions. Proceedings of the 16th Annual Symposium on Computational Geometry. ACM: New York, NY, U.S.A., 2000; 223-232.
7. Dey TK, Goswami S. Tight cocone: a water-tight surface reconstructor. Journal of Computing and Information Science in Engineering 2003; 3:302.
8. Cebral J, Lohner R. From medical images to anatomically accurate finite element grids. International Journal for Numerical Methods in Engineering 2001; 51(8):985-1008.
9. Wu Z, Sullivan J. Multiple material marching cubes algorithm. International Journal for Numerical Methods in Engineering 2003; 58(2):189-207.
10. Boissonnat J. Shape reconstruction from planar cross sections. Computer Vision, Graphics, and Image Processing 1988; 44(1):1-29.
11. Oliva J, Perrin M, Coquillart S. 3D reconstruction of complex polyhedral shapes from contours using a simplified generalized Voronoi diagram. Computer Graphics Forum, vol. 15. Blackwell Science Ltd: Oxford, 1996; 397-408.
12. Cong G, Parvin B. Robust and efficient surface reconstruction from contours. The Visual Computer 2001; 17(4):199-208.
13. Wang D, Hassan O, Morgan K, Weatherill N. Efficient surface reconstruction from contours based on two-dimensional Delaunay triangulation. International Journal for Numerical Methods in Engineering 2006; 65:734-751.
14. Hoppe H, DeRose T, Duchamp T, McDonald J, Stuetzle W. Surface reconstruction from unorganized points. Computer Graphics New York Association for Computing Mechinery 1992; 26:71-71.
15. Curless B, Levoy M. A volumetric method for building complex models from range images. SIGGRAPH96. Computer Graphics Proceedings, 1996.
16. Alexa M, Behr J, Cohen-Or D, Fleishman S, Levin D, Silva C. Point set surfaces IEEE Visualization 2001; 1:21-28.
17. Ohtake Y, Belyaev A, Alexa M, Turk G, Seidel H. Multi-level partition of unity implicits. International Conference on Computer Graphics and Interactive Techniques. ACM: New York, NY, U.S.A., 2005.
18. Zhao H, Osher S, Fedkiw R. Fast surface reconstruction using the level set method. Proceedings of the IEEE Workshop on Variational and Level Set Methods (VLSM'01). IEEE Computer Society: Washington, DC, U.S.A., 2001; 194.
19. George P, Hecht F, Saltel E. Automatic mesh generator with specified boundary. Computer Methods in Applied Mechanics and Engineering 1991; 92(3):269-288.
20. Weatherill N, Hassan O. Efficient three-dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints. International Journal for Numerical Methods in Engineering 1994; 37(12):2005-2039.
21. Shewchuk J. Constrained Delaunay tetrahedralizations and provably good boundary recovery. Eleventh International Meshing Roundtable, Citeseer, 2002; 193-204.
22. Karamete B, Beall M, Shephard M. Triangulation of arbitrary polyhedra to support automatic mesh generators. International Journal for Numerical Methods in Engineering 2000; 49:167-191.
23. Du Q, Wang D. Boundary recovery for three dimensional conforming Delaunay triangulation. Computer Methods in Applied Mechanics and Engineering 2004; 193(23-26):2547-2563.
24. Du Q, Wang D. Constrained boundary recovery for three dimensional Delaunay triangulations. International Journal for Numerical Methods in Engineering 2004; 61(9):1471-1500.
25. Hornung A, Kobbelt L. Robust reconstruction of watertight 3d models from non-uniformly sampled point clouds without normal information. Geometry Processing 2006: Fourth Eurographics Symposium on Geometry Processing Cagliari, Sardinia Italy, 26-28 June 2006, Eurographics 2006; 41.
26. Kolmogorov V, Zabin R. What energy functions can be minimized via graph cuts? IEEE Transactions on Pattern Analysis and Machine Intelligence 2004; 26(2):147-159.
27. Greig D, Porteous B, Seheult A. Exact maximum a posteriori estimation for binary images. Journal of the Royal Statistical Society, Series B (Methodological) 1989; 271-279.
28. Kolmogorov V, Zabih R, Gortler S. Generalized Multi-camera Scene Reconstruction Using Graph Cuts. Lecture Notes in Computer Science. Springer: Berlin, 2003; 501-516.
29. Vogiatzis G, Torr P, Cipolla R. Multi-view stereo via volumetric graph-cuts. IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2005, CVPR 2005, vol. 2, 2005.
30. Paris S, Sillion F, Quan L. A surface reconstruction method using global graph cut optimization. International Journal of Computer Vision 2006; 66(2):141-161.
31. Hornung A, Kobbelt L. Hierarchical volumetric multi-view stereo reconstruction of manifold surfaces based on dual graph embedding. 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, vol. 1, 2006.
32. Sormann M, Zach C, Bauer J, Karner K, Bishof H. Watertight Multi-view Reconstruction Based on Volumetric Graph-cuts. Lecture Notes in Computer Science, vol. 4522. Springer: Berlin, 2007; 393.
33. Boykov Y, Veksler O, Zabih R. Fast approximate energy minimization via graph cuts. IEEE Transactions on Pattern Analysis and Machine Intelligence 2001; 23(11):1222-1239.
34. Komodakis N, Tziritas G, Paragios N. Fast, approximately optimal solutions for single dynamic MRFs. IEEE Conference on Computer Vision and Pattern Recognition, 2007. CVPR'07, 2007; 1-8.
35. Lempitsky V, Rother C, Blake A. Logcut-efficient graph cut optimization for Markov random fields. IEEE 11th International Conference on Computer Vision, 2007. ICCV 2007, Citeseer, 2007.
36. Bae E, Tai XC. In Graph Cut Optimization for the Piecewise Constant Level Set Method Applied to Multiphase Image Segmentation. Tai XC, Morken K, Lysaker M, Lie KA (eds), SSVM. Lecture Notes in Computer Science, vol. 5567. Springer: New York, 2009; 1-13. Available from.
37. George PL, Borouchaki H. Delaunay Triangulation and Meshing: Application to Finite Elements. Kogan Page, 1998; 20-21.
38. Borouchaki H, Lo S. Fast Delaunay triangulation in three dimensions. Computer Methods in Applied Mechanics and Engineering 1995; 128(1-2):153-167.
39. Borouchaki H, George P, Lo S. Optimal Delaunay point insertion. International Journal for Numerical Methods in Engineering 1996; 39, 20.
40. Cgal. Computational geometry algorithms library. Available from.
41. Du Q, Faber V, Gunzburger M. Centroidal Voronoi tessellations: applications and algorithms. SIAM Review 1999; 41(4):637-676.
42. Du Q, Wang D. Tetrahedral mesh generation and optimization based on centroidal Voronoi tessellations. International Journal for Numerical Methods in Engineering 2002; 56:1355-1373.
43. Du Q, Wang D. Anisotropic centroidal Voronoi tessellations and their applications. SIAM Journal on Scientific Computing 2005; 26(3):737-761.
44. Boykov Y, Kolmogorov V. An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. IEEE Transactions on Pattern Analysis and Machine Intelligence 2004; 1124-1137.
45. Boykov Y, Jolly M. Interactive graph cuts for optimal boundary and region segmentation of objects in ND images. International Conference on Computer Vision, Citeseer, vol. 1, 2001; 105-112.