Efficient surface reconstruction from contours based on two-dimensional Delaunay triangulation

International Journal for Numerical Methods in Engineering

Volumn 65, Issue 5, 2006, Pages 734-751

  Wang, Desheng ^a   Hassan, Oubay ^a   Morgan, Kenneth ^a   Weatherill, Nigel P ^a  

^a SWANSEA UNIVERSITY   (United Kingdom)

Author keywords

Branching; Correspondence; Delaunay triangulation; Surface reconstruction; Tiling

Indexed keywords

ALGORITHMS; COMPUTER GRAPHICS; CONFORMAL MAPPING; IMAGE RECONSTRUCTION; INTERPOLATION; MATHEMATICAL TRANSFORMATIONS;

DELAUNAY TRIANGULATION; SURFACE RECONSTRUCTION; SURFACE REMESHING; SURFACE SMOOTHING;

IMAGING TECHNIQUES;

ALGORITHMS; COMPUTER GRAPHICS; CONFORMAL MAPPING; IMAGE RECONSTRUCTION; IMAGING TECHNIQUES; INTERPOLATION; MATHEMATICAL TRANSFORMATIONS;

EID: 31644451095     PISSN: 00295981     EISSN: None     Source Type: Journal    
DOI: 10.1002/nme.1465     Document Type: Article

References (32)

1. Bajaj C, Coyle E, Lin K. Arbitrary topology shape reconstruction from planar cross sections. Graphical Models and Image Processing 1996; 58(6):524-543.
2. Wu Z, Sullivan JM. Multiple material marching cubes algorithm. International Journal for Numerical Methods in Engineering 2003; 58(2):189-207.
3. Oliva JM, Perrin M, Coquillart S. 3D reconstruction of complex polyhedral shapes from contours using a simplified generalized Voronoi diagram. Computer Graphics Forum 1996; 15(3):397-408.
4. Lin W, Chen S. A new surface interpolation technique for reconstructing 3D objects from serial cross-sections. Computer Vision, Graphics and Image Processing 1989; 48:124-143.
5. Boyer E, Berger M-O. 3D surface reconstruction using occluding contours. International Journal of Computer Vision 1997; 22(3):219-233.
6. Fuchs H, Kedem ZM, Uselton SP. Optimal surface reconstruction from planar contours. Communications of the ACM 1977; 20(10):693-702.
7. Zyda M, Jones A, Hegan PG. Surface construction from planar contours. Computers and Graphics 1987; 11: 393-408.
8. Jones MW, Chen M. A new approach to the construction of surfaces from contour data. Computer Graphics Forum 1994; 13(3):75-84.
9. Keppel E. Approximating complex surfaces by triangulation of contour lines. IBM Journal of Research Development 1975; 19:2-11.
10. Ganapathy S, Dennechy TG. A new general triangulation method for planar contours. Computers and Graphics 1982; 16:69-75.
11. Boissonnat J. Shape reconstruction from planar cross sections. Computer Vision, Graphics, and Image Processing 1988; 44(1):1-29.
12. Cheng SW, Dey TK. Improved construction of Delaunay based contour surfaces. Proceedings of the ACM Symposium on Solid Modelling and Applications 1999; 99:322-323.
13. Meyes D, Skinner S, Sloan K. Surface from contours. ACM Transactions on Graphics 1992; 11(3):228-258.
14. Cong G, Parvin B. Robust and efficient surface reconstruction from contours. The Visual Computer 2001; 17: 199-208.
15. Barequet G, Sharir M. Piecewise-linear interpolation between polygonal slices. Computer Vision and Image Understanding 1996; 63:251-272.
16. Barequet G, Goodrich MT, Levi-Steiner A, Steiner D. Straight-skeleton based contour interpolation. Proceedings of the 14th Annual ACM - SIAM Symposium on Discrete Algorithms, Baltimore, MD, 2003; 119-127.
17. Bereg S, Jiang M, Zhu B. Contour interpolation with bounded dihedral angles. ACM Symposium on Solid Modeling and Applications 2004; 303-308.
18. Surazhsky T, Surazhsky V, Barequet G, Tal A. Blending polygonal shapes with different topologies. Computers and Graphics 2001; 25(1):29-39.
19. 1-continuous terrain reconstruction from sparse contours. Proceedings of Vision, Modeling and Visualization 2003; 289-297.
20. Bentley JL, Ottmann T. Algorithms for reporting and counting geometric intersections. IEEE Transactions on Computers 1979; 643-647.
21. Rourke JO. Computational Geometry in C (2nd edn). Cambridge University Press: Cambridge, 1998; 264-266.
22. George PL, Borouchaki H. Delaunay Triangulation and Meshing. Application to Finite Elements Methods. Hermès: Paris, 1998.
23. George PL, Hecht F, Saltel E. Automatic mesh generator with specified boundary. Computer Methods in Applied Mechanics and Engineering 1991; 92:269-288.
24. Bowyer A. Computing Dirichlet tessellations. The Computer Journal 1981; 24:162-166.
25. Marcum DL, Weatherill NP. Unstructured grid generation using iterative point insertion and local reconnection. AIAA Journal 1995; 33:1619-1625.
26. Lawson CL. Properties of n-dimensional triangulations. Computer Aided Geometric Design 1986; 3:231-246.
27. Thompson J, Soni BK, Weatherill NP. Handbook of Grid Generation. CRC Press LLC: Boca Raton, FL, 1999.
28. Vollmer J, Mencl R, Müller H. Improved Laplacian smoothing of noisy surface meshes. Computer Graphics Forum 1999; 18(3):131-138.
29. Frey PJ. About surface remeshing. 9th International Meshing Roundtable 2000; 123-156.
30. Wang D, Hassan O, Morgan K, Weatherill NP. Enhanced remeshing from STL files and its application to surface grid generation. Communications in Numerical Methods in Engineering, 2005, submitted.
31. Borouchaki H, Hecht F, Frey PJ. Mesh gradation control. International Journal for Numerical Methods in Engineering 1998; 43(6):1143-1157.
32. 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: 2005-2039.