Techniques for accelerating B-rep based parallel machining simulation

✍ Scribed by R.V. Fleisig; A.D. Spence

• Publisher: Elsevier Science
• Year: 2005
• Tongue: English
• Weight: 565 KB
• Volume: 37
• Category: Article
• ISSN: 0010-4485
• DOI: 10.1016/j.cad.2004.11.008

✦ Synopsis

Continued progress in the area of solid modeller based machining process simulation is hindered by the complexity growth that occurs for a large number of tool-paths, n. For this reason, many researchers have adopted the Z-buffer approach. Boundary-representation (B-rep), however, remains the dominant choice for commercial computer aided design and manufacturing software. In this paper, it is shown that, under practical 2 1/2 D machining assumptions, the total number of tool-path neighbour pairs is O(n), and therefore the average ratio of simulated to subtracted tool-paths remains constant. Tool-path neighbours are grouped and simulated in parallel, greatly reducing wall clock running time. Running time is further reduced by filtering the intersection graph for edges and faces that are relevant to the cutter immersion. This information is subsequently used to discard irrelevant and time consuming intersection operations. Overall, a 90% decrease in wall clock running time was achieved.