Abstract

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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.