A Surface Reconstruction Algorithm Using Weighted Alpha Shapes

  • Si Hyung Park
  • Seoung Soo Lee
  • Jong Hwa Kim
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3613)

Abstract

This paper discusses a surface reconstruction method using the Delaunay triangulation algorithm. Surface reconstruction is used in various engineering applications to generate CAD model in reverse engineering, STL files for rapid prototyping and NC codes for CAM system from physical objects. The suggested method has two other components in addition to the triangulation: the weighted alpha shapes algorithm and the peel-off algorithm. The weighted alpha shapes algorithm is applied to restrict the growth of tetrahedra, where the weight is calculated based on the density of points. The peel-off algorithm is employed to enhance the reconstruction in detail. The results show that the increase in execution time due to the two additional processes is very small compared to the ordinary triangulation, which demonstrates that the proposed surface reconstruction method has great advantage in execution time for a large set of points.

Keywords

Voronoi Diagram Delaunay Triangulation Delaunay Triangle Alpha Shape Unorganized Point 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Edelsbrunner, H.: Surface Reconstruction by Wrapping Finite Sets in Space. Technical Report 96-001. Raindrop Geomagic. Inc. (1996)Google Scholar
  2. 2.
    Edelsbrunner, H., Shah, N.: Triangulating Topological Spaces. In: Proceedings 10th ACM Symp., Computational Geometry, pp. 285–292 (1994)Google Scholar
  3. 3.
    Edelsbrunner, H., Mucke, E.P.: Three-Dimensional Alpha-Shapes. ACM Transactions on Graphics 13(1), 43–72 (1994)MATHCrossRefGoogle Scholar
  4. 4.
    Edelsbrunner, H.: WeightAlpha Shapes.TechnicalReportUIUCDCS-R-92-1760, Department of Computer Science. University of Illinois at Urbana-Champaign (1992)Google Scholar
  5. 5.
    Edelsbrunner, H., Kirkpatrick, D.G., Seidel, R.: On the Shape of a Set of Points in the Plane. IEEE Transactions on Information Theory, IT 29(4), 551–559 (1983)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Edelsbrunner, H., Shah, N.: Triangluating Topological Spaces. In: Proceedings 10th ACM Symposium Computational Geometry, pp. 43–72 (1994)Google Scholar
  7. 7.
    Cheng, H.-L., Dey, T.K., Edelsbrunner, H., Sullivan, J.: Dynamic Skin Triangulation. Discrete Comput. Geom. 25, 525–568 (2001)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Akkiraju, N., Edelsbrunner, H.: Triangulating the Surface of a Molecule. Discrete Appl. Math. 71, 5–22 (1995)CrossRefMathSciNetGoogle Scholar
  9. 9.
    Amenta, N., Choi, S., Rote, G.: Incremental Constructions con BRIO. In: ACM Symposium on Computational Geometry, pp. 211–219 (2003)Google Scholar
  10. 10.
    Choi, S., Amenta, N.: Delaunay Triangulation Programs on Surface Data. In: The 13th ACM-SIAM Symposium on Discrete Algorithms, pp. 135–136 (2002)Google Scholar
  11. 11.
    Amenta, N., Choi, S., Kolluri, R.: The Power Crust. In: Proceedings of 6th ACM Symposium on Solid Modeling, pp. 249–260 (2001)Google Scholar
  12. 12.
    Amenta, N., Choi, S., Kolluri, R.: The Power Crust, Unions of Balls, and the Medial Axis Transform. Computational Geometry: Theory and Applications 19(2-3), 127–153 (2001)MATHMathSciNetGoogle Scholar
  13. 13.
    Amenta, N., Bern, M.: Surface Reconstruction by Voronoi filtering. Discrete and Computational Geometry 22, 481–504 (1999)MATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Amenta, N., Bern, M., Eppstein, D.: The Crust and the Beta-Skeleton: Combinatorial Curve Reconstruction. Graphical Models and Image Processing, 60/2 2, 125–135 (1998)CrossRefGoogle Scholar
  15. 15.
    Amenta, N., Bern, M., Eppstein, D.: Optimal Point Placement for Mesh Smoothing. Journal of Algorithms 30, 302–322 (1999)MATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Hoppe, H.: Surface Reconstruction from Unorganized Points. Ph.D. Thesis, Computer Science and Engineering, University of Washington (1994)Google Scholar
  17. 17.
    Hoppe, H., DeRose, T., Duchamp, T., McDonald, J., Stuetzle, W.: Surface Reconstruction from Unorganized Points. In: SIGGRAPH 1992 Proceedings, pp. 71–78 (1992)Google Scholar
  18. 18.
    Park, S.H., Lee, S.S., Kim, J.H.: The Delaunay Triangulation by Grid Subdivision. In: Gervasi, O., Gavrilova, M.L., Kumar, V., Laganá, A., Lee, H.P., Mun, Y., Taniar, D., Tan, C.J.K. (eds.) ICCSA 2005. LNCS, vol. 3482, pp. 1033–1042. Springer, Heidelberg (2005)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Si Hyung Park
    • 1
  • Seoung Soo Lee
    • 2
  • Jong Hwa Kim
    • 2
  1. 1.Voronoi Diagram Research CenterHanyang UniversitySeoulKorea
  2. 2.CAESITKonkuk UniversitySeoulKorea

Personalised recommendations