Skip to main content

Appendix G: Constructing Signed Distance Fields for 3D Polyhedra

  • Chapter
Guide to Dynamic Simulations of Rigid Bodies and Particle Systems

Part of the book series: Simulation Foundations, Methods and Applications ((SFMA))

Abstract

This Appendix describes the use of signed distance fields to create a simplified, lower-resolution version of the objects registered with the simulation engine. The memory efficient algorithm presented in this book is capable of handling grid-resolutions for the signed fields on the order of thousands of cells along each coordinate axis. A collision detection and response algorithm based on signed distance fields is also discussed.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 54.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

Notes

  1. 1.

    This point-in-object test is covered in details in Sect. 2.5.13 of Chap. 2.

  2. 2.

    In the particular case of using a bounding-sphere representation for the object, we need to use the corner vertices of the axis-aligned box bounding the sphere.

References

  1. Baerentzen, J.A., Aanaes, H.: Generating signed distance fields from triangle meshes. Technical Report IMM-TR-2002-21, Technical University of Denmark (2002)

    Google Scholar 

  2. Bloomenthal, J.: An implicit surface polygonizer. In: Graphics Gems IV, pp. 324–349 (1994)

    Google Scholar 

  3. Coutinho, M., Marino, S.: Systems and Methods for Representing Signed Distance Functions. US Patent 7,555,163. Sony Pictures Imageworks

    Google Scholar 

  4. Guendelman, E., Bridson, R., Fedkiw, R.: Nonconvex rigid bodies with stacking. Comput. Graph. (Proc. SIGGRAPH) 22, 871–878 (2003)

    Article  Google Scholar 

  5. Lorensen, W.E., Cline, H.E.: Marching cubes: a high resolution 3D surface construction algorithm. Comput. Graph. (Proc. SIGGRAPH) 21(4) (1987)

    Google Scholar 

  6. Lewiner, T., Lopes, H., Vieira, A.W., Tavares, G.: Efficient implementation of marching cubes cases with topological guarantees. J. Graph. Tools 8(2), 1–18 (2003)

    Article  Google Scholar 

  7. Sethian, J.A.: A fast marching level set method for monotonically advancing fronts. Proc. Natl. Acad. Sci. 93(4), 1591–1595 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  8. Sethian, J.A.: Level Set Methods and Fast Marching Methods. Cambridge University, Cambridge (1999)

    MATH  Google Scholar 

  9. Velho, L., Gomes, J., de Figueiredo, L.H.: Implicit Objects in Computer Graphics. Springer, Berlin (2002)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag London

About this chapter

Cite this chapter

Coutinho, M.G. (2013). Appendix G: Constructing Signed Distance Fields for 3D Polyhedra. In: Guide to Dynamic Simulations of Rigid Bodies and Particle Systems. Simulation Foundations, Methods and Applications. Springer, London. https://doi.org/10.1007/978-1-4471-4417-5_12

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-4417-5_12

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-4471-4416-8

  • Online ISBN: 978-1-4471-4417-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics