MPI-INF Logo
Publications

Server    domino.mpi-inf.mpg.de

Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop

Author, Editor
Author(s):
Schömer, Elmar
Reichel, Joachim
Warken, Thomas
Lennerz, Christian
dblp
dblp
dblp
dblp
Editor(s):
Lee, Kunwoo
Patrikalakis, Nicholas M.
dblp
dblp
Not MPII Editor(s):
Lee, Kunwoo
Patrikalakis, Nicholas M.
BibTeX cite key*:
SRWLSM02
Title, Booktitle
Title*:
Efficient Collision Detection for Curved Solid Objects
Booktitle*:
Proceedings of the Seventh ACM Symposium on Solid Modeling and Applications
Event, URLs
Conference URL::
http://www.mpi-sb.mpg.de/conferences/sm02/
Downloading URL:
http://portal.acm.org/citation.cfm?doid=566282.566328#FullText
Event Address*:
Saarbrücken, Germany
Language:
English
Event Date*
(no longer used):
-- June 17 - 21, 2002
Organization:
Association of Computing Machinery (ACM)
Event Start Date:
17 June 2002
Event End Date:
21 June 2002
Publisher
Name*:
ACM
URL:
http://www.acm.org/
Address*:
New York, USA
Type:
Vol, No, Year, pp.
Series:
Volume:
Number:
Month:
Pages:
321-328
Year*:
2002
VG Wort Pages:
29
ISBN/ISSN:
1-58113-506-8
Sequence Number:
DOI:
Note, Abstract, ©
(LaTeX) Abstract:
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.
Keywords:
Computational Geometry, Object Modeling, Simulation, Collision Detection, Curved Objects
Download
Access Level:
Public

Correlation
MPG Unit:
Max-Planck-Institut für Informatik
MPG Subunit:
Algorithms and Complexity Group
Audience:
Expert
Appearance:
MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort



BibTeX Entry:

@INPROCEEDINGS{SRWLSM02,
AUTHOR = {Sch{\"o}mer, Elmar and Reichel, Joachim and Warken, Thomas and Lennerz, Christian},
EDITOR = {Lee, Kunwoo and Patrikalakis, Nicholas M.},
TITLE = {Efficient Collision Detection for Curved Solid Objects},
BOOKTITLE = {Proceedings of the Seventh {ACM} Symposium on Solid Modeling and Applications},
PUBLISHER = {ACM},
YEAR = {2002},
ORGANIZATION = {Association of Computing Machinery (ACM)},
PAGES = {321--328},
ADDRESS = {Saarbr{\"u}cken, Germany},
ISBN = {1-58113-506-8},
}


Entry last modified by Christine Kiesel, 03/02/2010
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Joachim Reichel
Created
12/12/2002 04:35:25 PM
Revisions
4.
3.
2.
1.
0.
Editor(s)
Christine Kiesel
Christine Kiesel
Joachim Reichel
Joachim Reichel
Joachim Reichel
Edit Dates
27.08.2003 18:50:46
27.08.2003 18:50:31
18/12/2002 16:02:58
12/12/2002 16:46:12
12/12/2002 16:35:25