Skip to main content

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 212))

  • 1208 Accesses

Abstract

As an important research subject of the CAD, computer geometry, reverse engineering and other areas. The triangulation of the unorganized data has great significance in theory and the practical. In this paper, we introduce the current mainstream methods of triangulation that based on 3D points cloud data as well as the hash tables and put forward a direct triangulations method which based on a ball expanding.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Wei Y, Su X (2008) Novel and fast mapping triangulation algorithm for unorganized pointscloud. Opt Eng 47(11): 117205–117211

    Google Scholar 

  2. Bernardini F, Mittleman J, Rushmeier H, Silva C, Taubin G (1999) The ball pivoting algorithm for surface reconstruction. IEEE T Vis Comput Gr 5(4):349–359

    Google Scholar 

  3. Huang J, Menq CH (2002) Combinatorial manifold mesh reconstruction and optimization from unorganized points with arbitrary topology. Comput Aided Design 34(2):149–165

    Google Scholar 

  4. Lin HW, Tai CL, Wang GJ (2004) A mesh reconstruction algorithm driven by an intrinsic property of point cloud. Comput Aided Design 36(1):1–9

    Google Scholar 

  5. Li X, Han CY, Wee WG (2009) On surface reconstruction: a priority driven approach. Comput Aided Design 41(9):626–640

    Google Scholar 

  6. Di Angelo L, Di Stefano P, Giaccari L (2011) A new mesh-growing algorithm for surface reconstruction. Comput Aided Design 43(6):639–650

    Google Scholar 

  7. Di Angelo L, Giaccari L (2011) A fast algorithm for manifold reconstruction of surfaces. In: Proceedings of the international conference on innovative methods in product design, Venice Italy

    Google Scholar 

  8. Edelsbrunner H, Mucke EP (1992) Three-dimensional alpha shapes. In: workshop on volume visualization, Boston, pp 75–82

    Google Scholar 

  9. Amenta N, Bern M, Eppstein D (1998) The crust and the beta-skeleton: combinatorial curve reconstruction. GMIP 60(2):125–135

    Google Scholar 

  10. Amenta N, Bern M, Kamvysselis M (1998) A new Voronoi-based surface reconstruction algorithm. In: The 25th annual conference on computer graphics and interactive techniques, New York, pp 415–421

    Google Scholar 

  11. Amenta N, Bern M (1999) Surface reconstruction by Voronoi filtering. DCG 22(4):481–504

    Google Scholar 

  12. Amenta N, Choi S, Dey TK, Leekha N (2002) A simple algorithm for homeomorphic surface reconstruction. Int J Comput Geom Ap 12(1–2):125–141

    Google Scholar 

  13. Chang MC, Leymarie FF, Kimia BB (2009) Surface reconstruction from point clouds by transforming the medial scaffold. Comput Vis Image 113(11):1130–1146

    Google Scholar 

  14. Dey TK, Goswami S (2003) Tight cocone: a watertight surface reconstructor. In: the 8th ACM symposium on solid modeling and applications. New York, pp 127–134

    Google Scholar 

  15. Dey TK, Goswami S (2006) Provable surface reconstruction from noisy samples. Comp Geom 35(1–2):124–141

    Google Scholar 

  16. Dey TK, Giesen J, Hudson J (2001) Delaunay based shape reconstruction from large data. In: The IEEE symposium on parallel and large-data visualization and graphics. San Diego, CA, USA, pp 19–146

    Google Scholar 

  17. Amenda N, Choi S, Kolluri R (2001) The power crust. In: The 6th ACM symposium on solid modeling and applications, pp 249–260

    Google Scholar 

  18. OuYang D, Feng HY (2011) Reconstruction of 2D polygonal curves and 3D triangular surfaces via clustering of Delaunay circles/spheres. Comput Aided Design 43(8):839–847

    Google Scholar 

Download references

Acknowledgments

This work is supported by the Program for Changjiang Scholars and Innovative Research Team in University(No.IRT1109), the Program for Liaoning Science and Technology Research in University (No.LS2010008), the Program for Liaoning Innovative Research Team in University(No.LT2011018), Natural Science Foundation of Liaoning Province (201102008), the Program for Liaoning Key Lab of Intelligent Information Processing and Network Technology in University and by “Liaoning BaiQianWan Talents Program(2010921010,2011921009)”.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Qiang Zhang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, Q., Wang, N., Zhou, D., Wei, X. (2013). A Triangulation Method for Unorganized Points Cloud Based on Ball Expanding. In: Yin, Z., Pan, L., Fang, X. (eds) Proceedings of The Eighth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA), 2013. Advances in Intelligent Systems and Computing, vol 212. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37502-6_141

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-37502-6_141

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-37501-9

  • Online ISBN: 978-3-642-37502-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics