In simulating the three dimensional packing process with arbitrary shaped objects, the task of detecting interference between objects is important and very difficult. This paper, representing the three dimensional packing space and objects with an octree, presents an effective interference detection algorithm, which can overcome the performance shortcomings that the conventional methods have in terms of real-time response, computer memory and computational accuracy. By recording the distribution status of packing space in the “bits” of short integers, the data space can be compressed to 1/16 of that used by conventional algorithms.

This content is only available via PDF.
You do not currently have access to this content.