日本語
 
User Manual Privacy Policy ポリシー/免責事項 連絡先
  詳細検索ブラウズ

アイテム詳細


公開

会議論文

Efficient Collision Detection for Curved Solid Objects

MPS-Authors
/persons/resource/persons45414

Schömer,  Elmar
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45275

Reichel,  Joachim
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45709

Warken,  Thomas
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44910

Lennerz,  Christian
Discrete Optimization, MPI for Informatics, Max Planck Society;

URL
There are no locators available
フルテキスト (公開)
公開されているフルテキストはありません
付随資料 (公開)
There is no public supplementary material available
引用

Schömer, E., Reichel, J., Warken, T., & Lennerz, C. (2002). Efficient Collision Detection for Curved Solid Objects. In Proceedings of the Seventh ACM Symposium on Solid Modeling and Applications (pp. 321-328). New York, NY: ACM.


引用: http://hdl.handle.net/11858/00-001M-0000-000F-2F60-D
要旨
The design-for-assembly technique requires realistic physically based simulation algorithms and in particular efficient geometric collision detection routines. Instead of approximating mechanical parts by large polygonal models, we work with the much smaller original CAD-data directly, thus avoiding precision and tolerance problems. We present a generic algorithm, which can decide whether two solids intersect or not. We identify classes of objects for which this algorithm can be efficiently specialized, and describe in detail how this specialization is done. These classes are objects that are bounded by quadric surface patches and conic arcs, objects that are bounded by natural quadric patches, torus patches, line segments and circular arcs, and objects that are bounded by quadric surface patches, segments of quadric intersection curves and segments of cubic spline curves. We show that all necessary geometric predicates can be evaluated by finding the roots of univariate polynomials of degree at most $4$ for the first two classes, and at most $8$ for the third class. In order to speed up the intersection tests we use bounding volume hierarchies. With the help of numerical optimization techniques we succeed in calculating smallest enclosing spheres and bounding boxes for a given set of surface patches fulfilling the properties mentioned above.