Abstract
A new algorithm for visualizing the clearance between mechanical parts in an assembly is proposed. This algorithm determines the clearance value based on the distance field of the parts. In the distance field construction, the shortest distance between a voxel and surface polygons of the model is computed many times. An OBB tree based culling operation is implemented for selecting polygons sufficiently close to the voxel. Close voxels usually refer similar set of polygons as their close ones. By using this spatial coherency, proposed parallel algorithm is designed to compute distances between a cluster of close voxels and the polygons selected by the culling operation. Voxel elements in the distance field are classified according to their closest polygon. For each polygon, a voxel with the largest distance in the voxels classified for the polygon is selected and its distance value is used as the clearance for the polygon. An experimental system visualizes the clearance between the parts by painting each polygon with a unique color corresponding to its clearance value.
Sign-in/Register to access full text options 
Free) 
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
