Hybrid Distance Field Computation

  • Richard Satherley
  • Mark W. Jones
Part of the Eurographics book series (EUROGRAPH)


Distance fields are a widely investigated area within the area of Volume Graphics. Research is divided between applications; such as — skeletonisation, hypertexture, voxelisation, acceleration of rendering techniques, correlation and collision detection; and the fundamental algorithmic calculation of the distance fields. This paper concentrates on the latter by presenting a new method for calculating distance fields and comparing it with the current best approximate method and the true Euclidean distance field. Details are given of the algorithm, and the acceleration methods that are used for calculating the true distance field. Brief descriptions of applications for these accurate distance fields are given at the end of the paper.


Computer Graphic Distance Calculation Collision Detection Vector Distance Distance Field 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    M. W. Jones and M. Chen. A new approach to the construction of surfaces from contour data. Computer Graphics Forum (Proceedings of Eurographics ‘84), 13 (3): C75 - C84, September 1994.CrossRefGoogle Scholar
  2. 2.
    M. W. Jones. The production of volume data from triangular meshes using voxelisation. Computer Graphics Forum, 15 (5): 311–318, December 1996.Google Scholar
  3. 3.
    M. S~râmek and A. E. Kaufman. Alias-free voxelization of geometric objects. IEEE Transactions on Visualization and Computer Graphics, 5 (3): 251–267, July-September 1999.Google Scholar
  4. 4.
    S. F. F. Gibson. Constrained elastic surfacenets: generating smooth surfaces from binary sampled data. In Proceedings Medical Image Cmputation and Computer Assisted Interventions, MICCAI’98, pages 888–898, October 1998.Google Scholar
  5. 5.
    Sarah E Frisken, Ronald N. Perry, Alyn P. Rockwood, and Thouis R. Jones. Adaptively sampled distance fields: A general representation of shape for computer graphics. Computer Graphics (Proceedings of SIGGRAPH 2000), pages 249–254, July 2000.Google Scholar
  6. 6.
    D. E. Breen amd S. Mauch and R.T. Whitaker. 3D scan conversion of CSG models into distance volumes. In Proceedings of the 1998 Symposium on Volume Visualisation, pages 7–14, October 1998.Google Scholar
  7. 7.
    D. E. Breen. Constructive Cubes: CSG evaluation for display using discrete 3D scalar data sets. Computer Graphics Forum (Proceedings of Eurographics ‘81), pages 127–142, September 1991.Google Scholar
  8. 8.
    J. A. Sethian. Level Set Methods. Cambridge University Press, 1996.Google Scholar
  9. 9.
    D. Cohen and Z. Sheffer. Proximity clouds–an acceleration technique for 3D grid traversal. The Visual Computer, 11: 27–38, 1994.CrossRefGoogle Scholar
  10. 10.
    S. K. Semwal and H. Kvarnstrom. Directed safe zones and the dual extent algorithms for efficient grid traversal during ray tracing. In Graphics Interface ‘87, pages 76–87, Kelowna, British Columbia, May 1997.Google Scholar
  11. 11.
    M. Srâmek and A. Kaufman. Fast ray-tracing of rectilinear volume data using distance transforms. IEEE Transactions on Visualization and Computer Graphics, 6 (3): 236–252, July–September 2000.Google Scholar
  12. 12.
    R. T. Whitaker and D. E. Breen. Level-set models for the deformation of solid objects. In Proceedings of the 3rd International Workshop on Implicit Surfaces, pages 19–35, 1998.Google Scholar
  13. 13.
    D. E. Breen and R. T. Whitaker. A level-set approach for the metamorphosis of solid models. To appear in IEEE Transactions on Visualization and Computer Graphics, 2001.Google Scholar
  14. 14.
    D. Cohen-Or, D. Levin, and A. Solomovici. Three-dimensional distance field metamorphosis. ACM Transactions on Graphics, 17 (2): 116–141, April 1998.CrossRefGoogle Scholar
  15. 15.
    N. Gagvani and D. Silver. Shape-based volumetric collision detection. In Volume Visualization and Graphics Symposium, pages 57–61, 2000.Google Scholar
  16. 16.
    N. Gagvani and D. Silver. Realistic volume animation with alias. In Volume Graphics, chapter 16, pages 253–263. Springer, 2000.Google Scholar
  17. 17.
    P-E. Danielsson. Euclidean distance mapping. Computer Graphics and Image Processing, 14: 227–248, 1980.CrossRefGoogle Scholar
  18. 18.
    Y. Zhou and A. W. Toga. Efficient skeletonization of volume objects. IEEE Visualization and Computer Graphics, 5 (3): 196–209, July 1999.CrossRefGoogle Scholar
  19. 19.
    J. Wilhelms and A. Van Gelder. Octrees for faster isosurface generation. ACM Transactions on Graphics, 11 (3): 201–227, July 1992.MATHCrossRefGoogle Scholar
  20. 20.
    A. Rosenfeld and J. L. Pfaltz. Sequential operations in digital picture processing. Journal of the ACM, 13 (4): 471–494, 1966.MATHCrossRefGoogle Scholar
  21. 21.
    G. Borgefors. Distance transformations in digital images. Computer Vision, Graphics, and Image Processing, 34 (3): 344–371, 1986.CrossRefGoogle Scholar
  22. 22.
    Q. Z. Ye. The signed Euclidean distance transform and its applications. In Proceedings, 9th International Conference on Pattern Recognition, pages 495–499, 1988.CrossRefGoogle Scholar
  23. 23.
    F. Leymarie and M. D. Levine. Fast rater scan distance propagation on the discrete rectangular lattice. CVGIP: Image Understanding, 55 (1): 84–94, January 1992.MATHCrossRefGoogle Scholar
  24. 24.
    J. C. Mullikin. The vector distance transform in two and three dimensions. CVGIP: Graphical Models and Image Processing, 54 (6): 526–535, 1992.CrossRefGoogle Scholar
  25. 25.
    O. Cuisenaire. Distance Transformations: Fast Algorithms and Applications to Medical Images Processing. PhD thesis, Laboratoire de Telecommunications et Teledetection, Université Catholique de Louvain, 1999.Google Scholar
  26. 26.
    B. A. Payne and A. W. Toga. Surface mapping brain function on 3D models. IEEE Computer Graphics and Applications, 10 (5): 33–41, September 1990.CrossRefGoogle Scholar
  27. 27.
    R. E. Webber. Ray tracing voxel data via biquadratic local surface interpolation. The Visual Computer, 6 (1): 8–15, February 1990.MathSciNetCrossRefGoogle Scholar
  28. 28.
    R. A. Satherley and M. W. Jones. Hypertexturing complex volume objects. In Proceeding of the 9-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision, pages 146–153, February 2001.Google Scholar

Copyright information

© Springer-Verlag/Wien 2001

Authors and Affiliations

  • Richard Satherley
    • 1
  • Mark W. Jones
    • 1
  1. 1.University of Wales SwanseaSwanseaUK

Personalised recommendations