Efficient Estimation of 3D Euclidean Distance Fields from 2D Range Images

    •  Frisken, S.F.; Perry, R.N., "Efficient Estimation of 3D Euclidean Distance Fields from 2D Range Images", Volume Visualization Symposia (VolVis), ISBN: 0-7803-7641-2, October 2002, pp. 81-88.
      BibTeX Download PDF
      • @inproceedings{Frisken2002oct,
      • author = {Frisken, S.F. and Perry, R.N.},
      • title = {Efficient Estimation of 3D Euclidean Distance Fields from 2D Range Images},
      • booktitle = {Volume Visualization Symposia (VolVis)},
      • year = 2002,
      • pages = {81--88},
      • month = oct,
      • isbn = {0-7803-7641-2},
      • url = {}
      • }
  • MERL Contact:
  • Research Areas:

    Algorithms, Computational Geometry, Mechatronics

TR Image
Figure 1. A 3-color quadtree of this 2D character requires 20,813 quadtree cells while a quadtree-based ADF using a bi-quadratic interpolant of the same accuracy requires only 399 cells (shown here).

Several existing algorithms for reconstructing 3D models from range data first approximate the object's 3D distance field to provide an implicit representation of the scanned object and then construct a surface model of the object using this distance field. In these existing approaches, computing and storing 3D distance values from range data contribute significantly to the computational and storage requirements. This paper presents an efficient method for estimating the 3D Euclidean distance field from 2D range images that can be used by any of these algorithms. The proposed method uses Adaptively Sampled Distance Fields to minimize the number of distance evaluations and significantly reduce storage requirements of the sampled distance field. The method is fast because much of the computation required to convert the line-of-sight range distances to Euclidean distances can be done during a pre-processing step in the 2D coordinate space of each range image.