Abstract
This paper presents a fast algorithm for detecting interference among 3D objects in an engineering design. The problem of interference detection is formulated as a spatial sorting and searching process. The algorithm first converts the 3D computation to 2D by utilizing a grid plane projection approach. A potential interference set is then formed that eliminates many obviously irrelevant object pairs. Geometric intersection computation is simplified as an integer set conjunction operation. The approach explores the high degree of regularity inherent in the domain-specific problem, and applies a model-reference method for a quick check of interference among object pairs in the design. The representation of the objects in cylindrical and spherical form provides extreme simplicity to the interference computation. A step-wise refinement process enhances the model building and facilitates the adaptation of the algorithm to various applications.
| Original language | English (US) |
|---|---|
| Pages | 403-409 |
| Number of pages | 7 |
| State | Published - 1988 |
| Externally published | Yes |
| Event | Computers in Engineering 1988 - Proceedings - San Francisco, CA, USA Duration: Jul 31 1988 → Aug 4 1988 |
Other
| Other | Computers in Engineering 1988 - Proceedings |
|---|---|
| City | San Francisco, CA, USA |
| Period | 7/31/88 → 8/4/88 |
ASJC Scopus subject areas
- General Engineering