DOI QR코드

DOI QR Code

STL Generation in Reverse Engineering by Delaunay Triangulation

역공학에서의 Delaunay 삼각형 분할에 의한 STL 파일 생성

  • Lee, Seok-Hui (Mechanical Technology Research Center, Dept.of Mechanical Engineering, Busan National University) ;
  • Kim, Ho-Chan (Graduate School of Busan National University) ;
  • Heo, Seong-Min (Graduate School of Busan National University)
  • 이석희 (부산대학교 기계공학부 및 기계기술연구소) ;
  • 김호찬 (부산대학교 대학원) ;
  • 허성민 (부산대학교 대학원)
  • Published : 2002.05.01

Abstract

Reverse engineering has been widely used for the shape reconstruction of an object without CAD data and the measurement of clay or wood models for the development of new products. To generate a surface from measured points by a laser scanner, typical steps include the scanning of a clay or wood model and the generation of manufacturing data like STL file. A laser scanner has a great potential to get geometrical data of a model for its fast measuring speed and higher precision. The data from a laser scanner are composed of many line stripes of points. A new approach to remove point data with Delaunay triangulation is introduced to deal with problems during reverse engineering process. The selection of group of triangles to be triangulated based on the angle between triangles is used for robust and reliable implementation of Delaunay triangulation as preliminary steps. Developed software enables the user to specify the criteria for the selection of group of triangles either by the angle between triangles or the percentage of triangles reduced. The time and error for handling point data during modelling process can be reduced and thus RP models with accuracy will be helpful to automated process.

Keywords

Reverse Engineering;Delaunay Triangulation;Laser Scanner;Triangular Net;RP;STL

References

  1. 허성민, 김호찬, 이석희, 2001, '역공학에서의 Delaunay 삼각형 분할에 의한 점 데이터 감소,' 대한기계학회논문집 A권, 제25권, 제8호, pp. 1246-1252
  2. Christiansen, H. N. and Sederberg, T. W., 1978, 'Conversion of Complex Contour Line Definition into Polygonal Element Mosaics,' Proc. of the ACM SIGGRAPH'78, pp. 187-192 https://doi.org/10.1145/800248.807388
  3. O'Rourke, J., 1994, 'Computational Geometry in C,' Cambridge University Press, New York
  4. Sarkar, B. and Menq, C. H., 1991, 'Smooth Surface Approximation and Reverse Engineering,' Computer Aided Design, Vol. 23 No. 9, pp. 623-628 https://doi.org/10.1016/0010-4485(91)90038-X
  5. Cho, M., Seo, T., Kim, J. and Kwon, O., 2000, 'Reverse Engineering of Compound Surfaces Using Boundary Detection Method,' KSME International Journal, Vol. 14, No. 10, pp. 1104-1113
  6. Hoppe, H., DeRose, T., Duchamp, T., McDonald, J. and Stuetzle, W., 1993, 'Mesh Optimization,' Computer GRAPHICS Proceedings, pp. 19-26 https://doi.org/10.1145/166117.166119
  7. Piegl, L. and Tiller, W., 1996, 'Algorithm for Approximate NURBS Skinning,' Computer Aided Design, Vol. 28, No. 9, pp. 699-706 https://doi.org/10.1016/0010-4485(95)00084-4
  8. Hamann, B., 1994, 'A Data Reduction Scheme for Triangulated Surfaces,' Computer Aided Geometric Design, Vol. 11, No. 2, pp. 197-214 https://doi.org/10.1016/0167-8396(94)90032-9
  9. Volpin, O., Sheffert, A., Bercotier, M. and Joskowicz, L., 1998, 'Mesh Simplification with Smooth Surface Reconstruction,' Computer Aided Design, Vol. 30, No. 11, pp. 875-882 https://doi.org/10.1016/S0010-4485(98)00044-X
  10. Chen, Y. H., Ng, C. T. and Wang, Y. Z., 1999, 'Generation of an STL File from 3D Measurement Data with User-controlled Data Reduction,' International Journal of Advanced Manufacturing Technology, Vol. 15, pp. 127-131 https://doi.org/10.1007/s001700050049
  11. Park, H. and Kim, K., 1995, 'An Adaptive Method for Smooth Surface Approximation to Scattered 3D Points,' Computer Aided Design, Vol. 27, No. 12, pp. 929-939 https://doi.org/10.1016/0010-4485(95)00006-2
  12. Lawson, C. L., 1977,' Software for C1 Surface Interpolation,' Mathematical Software Ⅲ, J. R. Rice, ed., Academic Press, New York
  13. Chen, Y. H. and Wang, Y. Z., 1999, 'Genetic Algorithms for Optimized Retriangulation in the Context of Reverse Engineering,' Computer Aided Design, Vol. 31, No. 4, pp. 261-271 https://doi.org/10.1016/S0010-4485(99)00026-3
  14. Cline, A. K. and Renka, R. L., 1984,' A Storage-Efficient Method for Construction of a Thiessen Triangulation,' Rocky Mountain Journal of Mathematics, Vol. 14, No. 1, pp. 119-139 https://doi.org/10.1216/RMJ-1984-14-1-119
  15. Bowyer, A., 1981,' Computing Dirichlet Tessellations,' Computer Journal, Vol. 24, No. 2, pp. 162-166 https://doi.org/10.1093/comjnl/24.2.162