| 摘要 |
PROBLEM TO BE SOLVED: To execute interference check preprocessing and interference check at high speed. SOLUTION: It is necessary to execute the generation of a convex closure and a near-by point linear list and preprocessing for the envelope of an object by a hierarchical globe in order to check interference between non-projected polyhedrons at high speed. A convex closure constitution part 1, a near-by point linear list preparation part 2 and a hierarchical globe two-divided tree generation part 3 respectively execute interference check high speed preprocessing and respectively generate a convex closure, a near-by point linear list and a hierarchical globe two-divided tree. Then a convex closure interference checking part 5 checks interference between convex closures, and when interference between the convex closures is started, a bubble collision execution part 6 executes a bubble collision method to find out a near-by poligon pair and an near-by polygon interference checking part 7 checks interference between a pair of near-by polygons to check interference between non-projected polyhedrons.
|
