Skip to main content
Log in

The Marching Intersections algorithm for merging range images

  • original article
  • Published:
The Visual Computer Aims and scope Submit manuscript

Abstract

A new algorithm for the integration of partially overlapping range images into a triangular mesh is presented. The algorithm consists of three main steps: it locates the intersections between the range surfaces and a reference grid chosen by the user, then merges all nearly coincident and redundant intersections according to a proximity criterion, and, finally, reconstructs the merged surface(s) from the filtered intersection set. Compared with previous methods, which adopt a volumetric approach, our algorithm shows lower computational costs and improves the accuracy of the surfaces produced. It takes into account the quality of the input measurements and is able to patch small holes corresponding to the parts of the 3D scanned object that were not observed by the acquisition device. The algorithm has been tested on several datasets of range maps; graphical and numeric results are reported.

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. Algorri M, Schmitt F (1995) Deformable models for reconstructing unstructured 3D data. Lecture notes in computer science, vol 905. Springer, Berlin Heidelberg New York, pp 420–428

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

    Google Scholar 

  3. Callieri M, Cignoni P, Scopigno R (2002) Reconstructing textured meshes from multiple range RGB maps. In: Proceedings of the 7th international fall workshop on vision, modeling, and visualization 2002, Erlangen, Germany, 20–22 November 2002

  4. Callieri M, Cignoni P, Ganovelli F, Montani C, Pingi P, Scopigno R (2003) VCLab’s tools for 3D range data processing. In: Arnold D, Chalmers A, Niccolucci F (eds) Proceedings of VAST 2003 and EG symposium on graphics and cultural heritage, Brighton, UK, 5–7 November 2003

  5. Cignoni P, Montani C, Rocchini C, Scopigno R, Tarini M (1999) Preserving attribute values on simplified meshes by re-sampling detail textures. Vis Comput 15(10):519–539

    Google Scholar 

  6. Cignoni P, Rocchini C, Montani C, Scopigno R (2003) External memory management and simplification of huge meshes. IEEE Trans Vis Comput Graph 9(4):525–537

    Google Scholar 

  7. Chen Y, Medioni G (1995) Description of complex objects from multiple range images using an inflating balloon model. Comput Vision Image Understand 61(3):325–334

    Article  Google Scholar 

  8. Curless B, Levoy M (1996) A volumetric method for building complex models from range images. In: Proceedings of SIGGRAPH’96, New Orleans, 4–9 August 1996. Comput Graph 30:303–312. Addison-Wesley, Reading, MA

    Google Scholar 

  9. Da Silva R, Shin-Ting W (1998) Reconstructing a 3D model from range images using radial flow model. In: Proceedings of the 11th SIBGRAPI conference, Rio de Janiero, 20–23 October 1998, pp 123–131

  10. Davis J, Marschner SR, Garr M, Levoy M (2002) Filling holes in complex surfaces using volumetric diffusion. In: Proceedings of the 1st international symposium on 3D data processing, visualization, and transmission (3DPVT ’02), Padua, Italy, 19–21 June 2002

  11. Goesele M, Granier X, Heidrich W, Seidel H-P (2003) Accurate light source acquisition and rendering. ACM Trans Graph 22(3):621–630

    Article  Google Scholar 

  12. Grosskopf S, Neugebauer J (1998) Fitting geometrical deformable models to registered range images. In: Kock R, van Gool L (eds) Proceedings of the SMILE ’98 conference, Freiburg, Germany, 6–7 June 1998. Lecture notes in computer science 1506. Springer, Berlin Heidelberg New York, pp 266–274

  13. Häusler G, Karbacher S (1997) Reconstruction of smoothed polyhedral surfaces from multiple range images. In: Girod B, Niemann H, Seidel H-P (eds) Proceedings of 3D Image Analysis and Synthesis ’97, Infix, Sankt Augustin, Germany, pp 191–198

  14. Hilton A, Illingworth J (1997) Multi-resolution geometric fusion. In: Proceedings of the international conference on recent advances in 3D digital imaging and modeling, Ottawa, Ontario, Canada, 12–15 May 1997. IEEE Press, New York, pp 181–188

  15. Hilton A, Stoddart AJ, Illingworth J, Windeatt T (1998) Implicit surface-based geometric fusion. Comput Vision Image Understand 69(3):273–291

    Article  Google Scholar 

  16. Hoppe H, DeRose T, Duchamp T, McDonald J, Stuetzle W (1992) Surface reconstruction from unorganized points. In: Proceedings of SIGGRAPH ’92, Chicago, 26–31 July 1992. Comput Graph 26(2):71–78

    Google Scholar 

  17. Howie CT, Blake EH (1994) The mesh propagation algorithm for isosurface construction. Comput Graph Forum 13(3):65–74

    Google Scholar 

  18. Ju T, Losasso F, Schaefer S, Warren J (2002) Dual contouring of hermite data. In: Proceedings of the 29th conference on computer graphics and interactive techniques (SIGGRAPH ’02), San Antonio, TX, 21–25 July 2002. ACM Trans Graph 21(3):339–346

    Article  Google Scholar 

  19. Kobbelt LP, Botsch M, Schwanecke U, Seidel H-P (2001) Feature-sensitive surface extraction from volume data. In: Proceedings of SIGGRAPH 2001, Los Angeles, 12–17 August 2001. Comput Graph 35(3):57–66. ACM Press, New York

    Google Scholar 

  20. Lorensen WE, Cline H (1987) Marching Cubes: a high resolution 3D surface construction algorithm. In: Proceedings of SIGGRAPH ’87, Anaheim, CA, July 1987. Comput Graph 21(4):163–170

    Google Scholar 

  21. Mencl R, Müller H (1998) Interpolation and approximation of surfaces from three-dimensional scattered data points. In: Proceedings of Eurographics’98 STAR – State of the Art Reports, pp 51–68

  22. Montani C, Scateni R, Scopigno R (1994) A modified look-up table for implicit disambiguation of Marching Cubes. Vis Comput 10(6):353–355

    Google Scholar 

  23. Narkhede A, Manocha D (1995) Fast polygon triangulation based on Seidel’s algorithm. Graphics Gems V. Academic Press Professional, Boston, pp 394–397

  24. Pito R (1996) Mesh integration based on co-measurements. In: Proceedings of the international conference on image processing, Lausanne, Switzerland, 16–19 September 1996, pp 397–400

  25. Pulli K, Duchamp T, Hoppe H, McDonald J, Shapiro L, Stuetzle W (1997) Robust meshes from multiple range maps. In: Proceedings of the international conference on recent advances in 3D digital imaging and modeling, Ottawa, Ontario, Canada, 12–15 May 1997. IEEE Press, New York, pp 205–211

  26. Pulli K (1999) Multiview registration for large datasets. In: Proceedings of the 2nd international conference on 3D digital imaging and modeling, Ottawa, Ontario, Canada, 4–8 October 1999. IEEE Press, New York, pp 160–168

  27. Ratishauser M, Stricker M, Trobina M (1994) Merging range images of arbitrarily shaped objects. In: Proceedings of the IEEE conference on computer vision and pattern recognition, Seattle, 20–24 June 1994, pp 573–580

  28. Rocchini C, Cignoni P, Ganovelli F, Montani C, Pingi P, Scopigno R (2001) Marching Intersections: an efficient resampling algorithm for surface management. In: Proceedings of the international conference on shape modeling and applications (SMI 2001), Genoa, Italy, 7–11 May 2001

  29. Rocchini C, Cignoni P, Montani C, Scopigno R (2002) Acquiring, stitching and blending appearance attributes on 3D models. Vis Comput 18(3):186–204

    Google Scholar 

  30. Roth G, Wibowoo E (1997) An efficient volumetric method for building closed triangular meshes from 3-D image and point data. In: Proceedings of Graphics Interface ’97, Kelowna, BC, Canada, 21–23 May 1997, pp 173–180

  31. Soucy M, Laurendeau D (1995a) A general surface approach to the integration of a set of range views. IEEE Trans Patt Anal Mach Intell 17(4):344–358

    Article  Google Scholar 

  32. Soucy M, Laurendeau D (1995b) A dynamic integration algorithm to model surfaces from multiple range views. Mach Vision Appl 8(1):53–62

    Google Scholar 

  33. Taubin G (1995) A signal processing approach to fair surface design. In: Proceedings of SIGGRAPH ’95, Los Angeles, 6–11 August 1995, pp 351–358

  34. Turk G, Levoy M (1994) Zippered polygon meshes from range images. In: Proceedings of SIGGRAPH ’94, Orlando, FL, 24–29 July 1994. pp 311–318. ACM Press, New York

  35. Varadhan G, Krishnan S, Kim YJ, Manocha D (2003) Feature-sensitive subdivision and isosurface reconstruction. In: Proceedings of IEEE Visualization 2003, Seattle, 19–24 October 2003, pp 99–106

  36. Wheeler MD, Sato Y, Ikeuchi K (1998) Consensus surfaces for modeling 3D objects from multiple range images. In: Proceedings of the IEEE international conference on computer vision, Bombay, India, January 1998

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Claudio Montani.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rocchini, C., Cignoni, P., Ganovelli, F. et al. The Marching Intersections algorithm for merging range images. Visual Comp 20, 149–164 (2004). https://doi.org/10.1007/s00371-003-0237-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00371-003-0237-8

Keywords

Navigation