Advertisement

A New Region Growing Algorithm for Triangular Mesh Recovery from Scattered 3D Points

  • Chengjiang Long
  • Jianhui Zhao
  • Ravindra S. Goonetilleke
  • Shuping Xiong
  • Yihua Ding
  • Zhiyong Yuan
  • Yuanyuan Zhang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6758)

Abstract

A novel region growing algorithm is proposed for triangular mesh recovery from scattered 3D points. In our method, the new principle is used to determine the seed triangle considering both maximum angle and minimum length; the open influence region is defined for the active edge under processing; positional element is added into the criterion to choose the most suitable active point; geometric integrity is maintained by analyzing different situations of the selected active point and their corresponding treatments. Our approach has been tested with various unorganized point clouds, and the experimental results proved its efficiency in both accuracy and speed. Compared with the existing similar techniques, our algorithm has the ability to recover triangular meshes while preserving better topological coherence with the original 3D points.

Keywords

surface recovery triangular mesh region growing point cloud 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Kuo, C.-C., Yau, H.-T.: Reconstruction of virtual parts from unorganized scanned data for automated dimensional inspection. J. Comput Inf. Sci. Eng. Trans. ASME 3(1), 76–86 (2003)CrossRefGoogle Scholar
  2. 2.
    Kolingerova, I., Zalik, B.: Reconstructing domain boundaries within a given set of points using Delaunay triangulation. Computers & Geosciences 32(9), 1310–1319 (2006)CrossRefGoogle Scholar
  3. 3.
    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 65(5), 734–751 (2006)CrossRefzbMATHGoogle Scholar
  4. 4.
    Hoppe, H., DeRose, T., Duchampy, T., McDonaldz, J., Stuetzlez, W.: Surface reconstruction from unorganized points. In: Proceedings of SIGGRAPH 1992, pp. 71–78 (1992)Google Scholar
  5. 5.
    Carr, J.-C., Beatson, R.-K., Cherrie, J.-B., Mitchell, T.-J., Fright, W.-R., McCallum, B.-C.: Reconstruction and representation of 3D objects with radial basis functions. In: Proceedings of SIGGRAPH 2001, pp. 67–76 (2001)Google Scholar
  6. 6.
    Schreiner, J., Scheiclegger, C.-E., Silva, C.-T.: High-quality extraction of Isosurfaces from regular and irregular grids. Visualization and Computer Graphics 12(5), 1205–1212 (2006)CrossRefGoogle Scholar
  7. 7.
    Bernardini, F., Mittleman, J., Rushmeier, H., Silva, C., Taubin, G.: The ball pivoting algorithm for surface reconstruction. IEEE Trans. Vis. Comput. Graph. 5(4), 349–359 (1999)CrossRefGoogle Scholar
  8. 8.
    Petitjean, S., Boyer, E.: Regular and non-regular point sets: properties and reconstruction. Comput. Geom. Theory 19, 101–126 (2001)CrossRefzbMATHMathSciNetGoogle Scholar
  9. 9.
    Huang, J., Menq, C.-H.: Combinatorial manifold mesh reconstruction and optimization from unorganized points with arbitrary topology. Comput-Aided Design 34(2), 149–165 (2002)CrossRefGoogle Scholar
  10. 10.
    Lin, H., Tai, C., Wang, G.: A mesh reconstruction algorithm driven by an intrinsic property of a point cloud. Computer Aided Design 36(1), 1–9 (2004)CrossRefMathSciNetGoogle Scholar
  11. 11.
    DoRego, R.-L., Araujo, A.-F., De, L.-N., Fernando, B.: Growing self-organizing maps for surface reconstruction from unstructured point clouds. In: IEEE International Conference on Neural Networks, pp. 1900–1905 (2007)Google Scholar
  12. 12.
    Lv, H., Wang, Y.: A heuristic approach to reconstruct triangle mesh from unorganized point cloud. In: The 6th International Conference on Fuzzy Systems and Knowledge Discovery, pp. 87–91 (2009)Google Scholar
  13. 13.
    Jagan, S., Hanan, S., Amitabh, V.: A fast all nearest neighbor algorithm for applications involving large point-clouds. Computers & Graphics 31, 157–174 (2007)CrossRefGoogle Scholar
  14. 14.
    Boissonant, J.-D., Cazals, F.: Smooth surface reconstruction via natural neighbor interpolation of distance functions. In: Proceedings of 16th Annual Symposium On Computational Geometry (SCG 2000), Hong Kong, pp. 223–232 (2000)Google Scholar
  15. 15.
    Cheng, W., Sorguc, A.-G., Shinoda, J., Hagiwara, I.: MOAA and topology judgment for mesh construction. American Society of Mechanical Engineers 482, 227–238 (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Chengjiang Long
    • 1
  • Jianhui Zhao
    • 1
  • Ravindra S. Goonetilleke
    • 2
  • Shuping Xiong
    • 3
  • Yihua Ding
    • 1
  • Zhiyong Yuan
    • 1
  • Yuanyuan Zhang
    • 1
  1. 1.Computer SchoolWuhan UniversityWuhanPR China
  2. 2.Dept. Industrial Engineering and Logistics ManagementHong Kong University of Science and Technology (HKUST)Hong Kong
  3. 3.School of Design and Human EngineeringUlsan National Institute of Science and Technology (UNIST)UlsanRepublic of Korea

Personalised recommendations