Accessibility analysis for automatic inspection in CMMs by using bounding volume hierarchies

Accessibility analysis represents one of the most critical tasks in inspection planning. This analysis determines those probe orientations that can touch an inspection point without collision. This paper presents a methodology based on part discretization and the application of space partitioning techniques (kd-tree) in order to reduce the number of intersection tests between probe and part. A STL model has been used for discretizing the inspection part in a set of triangles, which permits the application of the developed system to any type of part, regardless of its shape and its complexity. Likewise, a recursive ray traversal algorithm has been used in order to speed up the traversal of the kd-tree hierarchical structure and to calculate exclusively the intersection of each probe orientation with those part triangles that can potentially interfere with it. In a further step of the analysis, the real geometry of the probe has been considered. Hence, a simplified model has been developed for each probe component (column, head, touch probe, stylus and tip) using different basic geometrical shapes. Finally, collision-free probe orientations are clustered for minimizing the orientation changes during the inspection process. Furthermore, the applied algorithm allows for determining different valid combinations of clusters. The developed system was applied to two example parts in order to prove that this methodology is adequate for the solution of real cases.

[1]  Tomas Akenine-Möller.  Fast 3D Triangle-Box Overlap Testing , 2001, J. Graphics, GPU, & Game Tools.

[2]  Sanjay E. Sarma,et al.  Collision-free finishing toolpaths from visibility data , 2003, Comput. Aided Des..

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

[4]  Chieh-Yuan Tsai,et al.  Efficient inspection planning for coordinate measuring machines , 2004 .

[5]  Aristides A. G. Requicha,et al.  Accessibility Analysis Using Computer Graphics Hardware , 2000, IEEE Trans. Vis. Comput. Graph..

[6]  C. W. Ziemian,et al.  Automated feature accessibility algorithm for inspection on a coordinate measuring machine , 1997 .

[7]  David H. Eberly,et al.  Geometric Tools for Computer Graphics , 2002 .

[8]  Shugui Liu,et al.  Improvement of coordinate measuring machine probing accessibility , 2004 .

[9]  Vlastimil Havran,et al.  Heuristic ray shooting algorithms , 2000 .

[10]  Gershon Elber,et al.  Precise global collision detection in multi-axis NC-machining , 2005, Comput. Aided Des..

[11]  C. P. Lim,et al.  CMM feature accessibility and path generation , 1994 .

[12]  Frederik W. Jansen,et al.  Data structures for ray tracing , 1986 .

[13]  David H. Eberly,et al.  3D game engine design - a practical approach to real-time computer graphics , 2000 .

[14]  Tomas Akenine-Möller,et al.  Fast, Minimum Storage Ray-Triangle Intersection , 1997, J. Graphics, GPU, & Game Tools.

[15]  Aristides A. G. Requicha,et al.  Accessibility analysis for the automatic inspection of mechanical parts by coordinate measuring machines , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[16]  Hoda A. ElMaraghy,et al.  Automated accessibility analysis and measurement clustering for CMMs , 2000 .

[17]  Anis Limaiem,et al.  A general method for analysing the accessibility of features using concentric spherical shells , 1997 .

[18]  Laurens R. A. Kessener,et al.  Data Structures for Raster Graphics , 1986 .

[19]  Zone-Ching Lin,et al.  Collision-free path planning for coordinate measurement machine probe , 2001 .

[20]  Martin Held,et al.  ERIT - A Collection of Efficient and Reliable Intersection Tests , 1997, J. Graphics, GPU, & Game Tools.

[21]  S G Zhang,et al.  The application of a knowledge-based clustering algorithm as an aid to probe selection and inspection process planning , 1998 .

[22]  Henry Fuchs,et al.  On visible surface generation by a priori tree structures , 1980, SIGGRAPH '80.

[23]  Joseph S. B. Mitchell,et al.  Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs , 1998, IEEE Trans. Vis. Comput. Graph..

[24]  D. Duce,et al.  Data Structures for Raster Graphics , 1986, EurographicSeminars.

[25]  A. N. Poo,et al.  Oriented bounding box and octree based global interference detection in 5-axis machining of free-form surfaces , 2004, Comput. Aided Des..

[26]  Yoshitaka Adachi,et al.  Real-time interference analysis between a tool and an environment , 2001, Comput. Aided Des..

[27]  Dinesh Manocha,et al.  OBBTree: a hierarchical structure for rapid interference detection , 1996, SIGGRAPH.

[28]  John K. Jackman,et al.  Probe orientation for coordinate measuring machine systems using design models , 1998 .

[29]  Han Ding,et al.  Visibility theory and algorithms with application to manufacturing processes , 2000 .

[30]  Deborah J. Medeiros,et al.  Part orientations for CMM inspection using dimensioned visibility maps , 1998, Comput. Aided Des..

[31]  C. W. Ziemian,et al.  Automating probe selection planning for inspection on measuring machine and part setup a coordinate , 1998, Int. J. Comput. Integr. Manuf..

[32]  Thomas Ertl,et al.  Computer Graphics - Principles and Practice, 3rd Edition , 2014 .

[33]  M. Carter.  Computer graphics: Principles and practice , 1997 .

[34]  A. Limaiem.  CATIP: A Computer-Aided Tactile Inspection Planning system , 1999 .

[35]  Hoda A. ElMaraghy,et al.  Optimal workpiece orientations for machining of sculptured surfaces , 2000 .