Thickness and clearance visualization based on distance field of 3D objects

Abstract This paper proposes a novel method for visualizing the thickness and clearance of 3D objects in a polyhedral representation. The proposed method uses the distance field of the objects in the visualization. A parallel algorithm is developed for constructing the distance field of polyhedral objects using the GPU. The distance between a voxel and the surface polygons of the model is computed many times in the distance field construction. Similar sets of polygons are usually selected as close polygons for close voxels. By using this spatial coherence, a parallel algorithm is designed to compute the distances between a cluster of close voxels and the polygons selected by the culling operation so that the fast shared memory mechanism of the GPU can be fully utilized. The thickness/clearance of the objects is visualized by distributing points on the visible surfaces of the objects and painting them with a unique color corresponding to the thickness/clearance values at those points. A modified ray casting method is developed for computing the thickness/clearance using the distance field of the objects. A system based on these algorithms can compute the distance field of complex objects within a few minutes for most cases. After the distance field construction, thickness/clearance visualization at a near interactive rate is achieved.

[1]  Tomas Akenine-Möller,et al.  Real-time rendering , 1997 .

[2]  Rüdiger Westermann,et al.  Distance Visualization for Interactive 3D Implant Planning , 2011, IEEE Transactions on Visualization and Computer Graphics.

[3]  Dinesh Manocha,et al.  Interactive 3D distance field computation using linear factorization , 2006, I3D '06.

[4]  Waldemar Celes Filho,et al.  GPU-accelerated Adaptively Sampled Distance Fields , 2008, 2008 IEEE International Conference on Shape Modeling and Applications.

[5]  James C. Mullikin,et al.  The vector distance transform in two and three dimensions , 1992, CVGIP Graph. Model. Image Process..

[6]  André Guéziec.  'Meshsweeper': Dynamic Point-to-Polygonal-Mesh Distance and Applications , 2001, IEEE Trans. Vis. Comput. Graph..

[7]  A. Guezlec,et al.  "Meshsweeper": dynamic point-to-polygonal mesh distance and applications , 2001 .

[8]  Alan Watt,et al.  The computer image , 1998 .

[9]  Roni Yagel,et al.  A simple visualization tool to support concurrent engineering design , 1997, Comput. Aided Des..

[10]  G. Elisabeta Marai,et al.  Modeling and Visualization of Inter-Bone Distances in Joints , 2001 .

[11]  Arthur W. Toga,et al.  Distance field manipulation of surface models , 1992, IEEE Computer Graphics and Applications.

[12]  O. Cuisenaire.  Distance transformations: fast algorithms and applications to medical image processing , 1999 .

[13]  Jakob Andreas Bærentzen,et al.  3D distance fields: a survey of techniques and applications , 2006, IEEE Transactions on Visualization and Computer Graphics.

[14]  Charlie C. L. Wang,et al.  Fast Intersection-Free Offset Surface Generation From Freeform Models With Triangular Meshes , 2011, IEEE Transactions on Automation Science and Engineering.

[15]  Marc Levoy,et al.  Efficient ray tracing of volume data , 1990, TOGS.

[16]  Aristides A. G. Requicha,et al.  Accessibility analysis for planning of dimensional inspection with coordinate measuring machines , 1999, IEEE Trans. Robotics Autom..

[17]  Young J. Kim,et al.  Exact and Adaptive Signed Distance FieldsComputation for Rigid and DeformableModels on GPUs , 2014, IEEE Transactions on Visualization and Computer Graphics.

[18]  G. Swaminathan.  Robot Motion Planning , 2006 .

[19]  Elliot K. Fishman,et al.  Volumetric rendering of computed tomography data: principles and techniques , 1990, IEEE Computer Graphics and Applications.

[20]  Frank Rhodes.  Discrete euclidean metrics , 1992, Pattern Recognit. Lett..

[21]  D. Manocha,et al.  Fast Distance Field Computation Using Graphics Hardware , 2010 .

[22]  Azriel Rosenfeld,et al.  Sequential Operations in Digital Picture Processing , 1966, JACM.

[23]  Hongkai Zhao,et al.  A fast sweeping method for Eikonal equations , 2004, Math. Comput..

[24]  Karupppasamy Subburaj,et al.  Voxel-Based Thickness Analysis of Intricate Objects , 2009 .

[25]  Dinesh Manocha,et al.  DiFi: Fast 3D Distance Field Computation Using Graphics Hardware , 2004, Comput. Graph. Forum.

[26]  Franziska Hoffmann,et al.  Spatial Tessellations Concepts And Applications Of Voronoi Diagrams , 2016 .

[27]  Dinesh Manocha,et al.  Fast computation of generalized Voronoi diagrams using graphics hardware , 1999, SIGGRAPH.

[28]  Bhaskar Sinha.  Efficient Wall Thickness Analysis Methods for Optimal Design of Casting Parts , 2007 .

[29]  Insung Ihm,et al.  Computing Local Signed Distance Fields for Large Polygonal Models , 2008, Comput. Graph. Forum.

[30]  Markus H. Gross,et al.  Signed distance transform using graphics hardware , 2003, IEEE Visualization, 2003. VIS 2003..

[31]  Benjamin B. Kimia,et al.  A formal classification of 3D medial axis points and their local geometry , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[32]  Ronald N. Perry,et al.  Adaptively sampled distance fields: a general representation of shape for computer graphics , 2000, SIGGRAPH.

[33]  Dipl.-Ing,et al.  Real-time Rendering , 2022 .

[34]  John C. Hart,et al.  Sphere tracing: a geometric method for the antialiased ray tracing of implicit surfaces , 1996, The Visual Computer.

[35]  M. Inui,et al.  A GPU based Algorithm for Determining the Optimal Cutting Direction in Deep Mold Machining , 2007, 2007 IEEE International Symposium on Assembly and Manufacturing.

[36]  P. Danielsson.  Euclidean distance mapping , 1980 .