This paper by Sud et al. at UNC-Chapel Hill, describes an algorithm for fast computation of discretized 3D distance fields using graphics hardware. It uses bounds on the spatial extent of the Voronoi region of each primitive to cull away many distance functions for each 2D slice. A combination of culling and clamping techniques results in rendering relatively few distance functions to reduce the load on the graphics pipeline. The algorithm is applicable to all geometric models and does not make any assumptions about connectivity or a manifold representation. The application is demonstrated for medial axis evaluation and proximity computations. As compared to earlier approaches, this GPU implementation achieves an order of magnitude improvement in the running time. (DiFi: Fast 3D Distance Field Computation Using Graphics Hardware. Avneesh Sud, Miguel A. Otaduy and Dinesh Manocha in Proc. Eurographics 2004, to appear, 2004.)