Skip to main content
Log in

A hybrid approach to smooth surface reconstruction from 2-D cross sections

  • Original Article
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

This article presents a hybrid approach to smooth surface reconstruction from serial cross sections, where the number of contours varies from section to section. In a triangular surface-based approach taken in most reconstruction methods, a triangular surface is constructed by stitching triangular patches over a triangular net generated from the compiled contours. In the proposed approach, the resulting surface is a G1 composite surface consisting of three kinds of surfaces: skinned, branched, and capped surfaces. Each skinned surface is first represented by a B-spline surface approximating the serial contours of the skinned region and then is transformed into a mesh of rectangular Bezier patches. On branched and capped regions, triangular G1 surfaces are constructed such that the connections between the triangular surfaces and their neighbouring surfaces are G1 continuous. Because each skinned region is represented by an approximated rectangular C2 surface instead of an interpolated triangular G1 surface, the proposed approach can provide more visually pleasing surfaces and realize more efficient data reduction than the triangular surface-based approach. Some experimental results demonstrate its usefulness and quality.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Park H, Kim K (1996) Smooth surface approximation to serial cross-sections. Comput Aided Des 28(12):995–1005

    Article  Google Scholar 

  2. Keppel E (1975) Approximating complex surfaces by triangulation of contour lines. IBM J Res Dev 19:2–11

    Article  MathSciNet  Google Scholar 

  3. Fuchs H, Kedem ZM, Uselton SP (1977) Optimal surface reconstruction from planar contours. Commun ACM 20(10):693–702

    Article  Google Scholar 

  4. Christiansen HN, Sederberg TW (1978) Conversion of complex contour line definition into polygonal element mosaics. Comput Graph 12(3):187–192

    Article  Google Scholar 

  5. Shantz M (1981) Surface definition for branching contour defined objects. Comput Graph 15(2):242–270

    Article  Google Scholar 

  6. Ganapathy S, Dennehy TG (1982) A new general triangulation method for planar contours. Comput Graph 16(3):69–75

    Article  Google Scholar 

  7. Zyda MJ, Allan RJ, Hogan PG (1987) Surface construction from planar contours. Comput & Graph 11(4):393–408

    Google Scholar 

  8. Boissonnat JD (1988) Shape reconstruction from planar cross sections. Comput Vision Graph Image Process 44:1–29

    Article  Google Scholar 

  9. Ekoule AB, Peyrin FC, Odet CL (1991) A triangulation algorithm from arbitrary shaped multiple planar contours. ACM Trans Graph 10(2):182–199

    Article  Google Scholar 

  10. Meyers D, Skinner S, Sloan K (1992) Surfaces from contours. ACM Trans Graph 11(3):228–258

    Article  Google Scholar 

  11. Choi YK, Park KH (1994) A heuristic triangulation algorithm for multiple planar contours using an extended double branching procedure. Visual Comput 10:372–387

    Article  Google Scholar 

  12. Park H, Kim K (1995) 3-D shape reconstruction from 2-D cross- sections. J Design and Manuf 5(3):171–185

    Google Scholar 

  13. Park H (1996) Surface modeling for 3D shape reconstruction from measurement data. Thesis, POSTECH, Korea

  14. Farin G (1985) A modified Clough-Tocher interpolant. Comput Aided Geometric Des 2:19–27

    Article  MathSciNet  Google Scholar 

  15. Piper B (1987) Visually smooth interpolation with triangular Bezeir Patches. In: Geometric Modeling: Algorithms and new trends. SIAM, pp 221–234

  16. Shirman LA, Sequin CH (1987) Local surface interpolation with Bezier patches. Comput Aided Geometric Des 4:279–295

    Article  MathSciNet  Google Scholar 

  17. Shin HY (1990) Surface modeling for 3D scattered data interpolation. Thesis, KAIST, Korea

  18. Choi BK (1991) Surface modeling for CAD/CAM. Elsevier

  19. Schmitt F, Chen X, Du W, Sair F (1991) Adaptive G1 approximation of range data using triangular patches. In: Curves and surfaces. Academic, pp 433–436

  20. Park H, Kim K (1995) An adaptive method for smooth surface approximation to scattered 3D points. Comput Aided Des 27(12):929–939

    Article  Google Scholar 

  21. Jeong J, Kim K, Park H, Cho H, Jung M (1999) B-spline surface approximation to cross-sections using distance maps. Int J Adv Manuf Technol 15(12):876–885

    Article  Google Scholar 

  22. Ballard DH, Brown CM (1982) Computer vision. Prentice Hall

  23. Pavlidis T (1982) Algorithms for graphics and image processing. Computer Science Press

  24. Piegl L, Tiller W (1995) The NURBS book. Springer, New York

  25. Hoschek J, Lasser D (1993) Fundamentals of computer aided geometric design. A K Peters

  26. Farin G (1993) Curves and surfaces for computer aided geometric design: a practical guide. Academic Press

    Google Scholar 

  27. Liu D, Hoschek J (1989) GC1 continuity conditions between adjacent rectangular and triangular Bezier surface patches. Comput Aided Des 21(4):194–200

    Article  Google Scholar 

  28. Zorin D, Schroder P (2000) Subdivision for modeling and animation. ACM SIGGRAPH

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hyungjun Park.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Park, H. A hybrid approach to smooth surface reconstruction from 2-D cross sections. Int J Adv Manuf Technol 25, 1130–1136 (2005). https://doi.org/10.1007/s00170-003-1953-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-003-1953-y

Keywords

Navigation