Skip to main content

Consensus Surfaces for Modeling 3D Objects from Multiple Range Images

  • Chapter
Modeling from Reality

Abstract

In this paper, we present a robust method for creating a triangulated surface mesh from multiple range images. Our method merges a set of range images into a volumetric implicit-surface representation which is converted to a surface mesh using a variant of the marching-cubes algorithm. Unlike previous techniques based on implicit-surface representations, our method estimates the signed distance to the object surface by finding a consensus of locally coherent observations of the surface. We call this method the consensus-surface algorithm. This algorithm effectively eliminates many of the troublesome effects of noise and extraneous surface observations without sacrificing the accuracy of the resulting surface. We utilize octrees to represent volumetric implicit surfaces—effectively reducing the computation and memory requirements of the volumetric representation without sacrificing accuracy of the resulting surface. We present results which demonstrate that our consensus-surface algorithm can construct accurate geometric models from rather noisy input range data.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. B. Curless, and M. Levoy, “A volumetric method for building complex models from range images,” In Proceedings of SIGGRAPH, ACM, 1996.

    Google Scholar 

  2. J. H. Friedman, J. Bentley, and R. Finkel, “An algorithm for finding best matches in logarithmic expected time,” ACM Transactions on Mathematical Software, 3(3):209–226, 1977.

    Article  MATH  Google Scholar 

  3. A. Hilton, A. Stoddart, J. Illingworth, and T. Windeatt, “Reliable surface reconstruction from multiple range images,” In Proceedings of the European Conference on Computer Vision, pages 117–126, Springer-Verlag, 1996.

    Google Scholar 

  4. H. Hoppe, T. DeRose, T. Duchamp, J. McDonald, and W. Stuetzle, “Surface reconstruction from unorganized points,” Computer Graphcics, 26(2):71–78, 1992.

    Article  Google Scholar 

  5. W. Lorensen, and H. E. Cline, “Marching cubes: a high resolution 3d surface construction algorithm,” In Proceedings of SIGGRAPH, pages 163–169, ACM, 1987.

    Google Scholar 

  6. D. J. R. Meagher, The octree encoding method for efficient solid modeling, PhD thesis, Rensselaer Polytechnic Institute, 1980.

    Google Scholar 

  7. G. Turk, and M. Levoy, “Zippered polygon meshes from range images,” In Proceedings of SIGGRAPH, pages 311–318, ACM, 1994.

    Google Scholar 

  8. M. D. Wheeler, Automatic Modeling and Localization for Object Recognition PhD thesis, Carnegie Mellon University, 1996.

    Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer Science+Business Media New York

About this chapter

Cite this chapter

Wheeler, M.D., Sato, Y., Ikeuchi, K. (2001). Consensus Surfaces for Modeling 3D Objects from Multiple Range Images. In: Ikeuchi, K., Sato, Y. (eds) Modeling from Reality. The Springer International Series in Engineering and Computer Science, vol 640. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-0797-0_3

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-0797-0_3

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-5244-0

  • Online ISBN: 978-1-4615-0797-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics