Efficient Collision Detection for Moving Polyhedra

DMCA

Efficient Collision Detection for Moving Polyhedra (1995)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Elmar Schömer , Christian Thiel

Venue:	In Proc. 11th Annu. ACM Sympos. Comput. Geom
Citations:	46 - 3 self

BibTeX

@INPROCEEDINGS{Schömer95efficientcollision,
    author = {Elmar Schömer and Christian Thiel},
    title = {Efficient Collision Detection for Moving Polyhedra},
    booktitle = {In Proc. 11th Annu. ACM Sympos. Comput. Geom},
    year = {1995},
    pages = {51--60}
}

OpenURL

Abstract

In this paper we consider the following problem: given two general polyhedra of complexity n, one of which is moving translationally or rotating about a fixed axis, determine the first collision (if any) between them. We present an algorithm with running time O(n 8=5+ffl ) for the case of translational movements and running time O(n 5=3+ffl ) for rotational movements, where ffl is an arbitrary positive constant. This is the first known algorithm with sub-quadratic running time. Universitat des Saarlandes, Fachbereich 14, Informatik, Im Stadtwald, D-66041 Saarbrucken, Germany. E-mail: schoemer@cs.uni-sb.de. y Max-Planck-Institut fur Informatik, Im Stadtwald, D-66123 Saarbrucken, Germany. E-mail: thiel@mpi-sb.mpg.de. This author was supported by the ESPRIT Basic Research Actions Program, under contract No. 7141 (project ALCOM II). 1 1 Introduction The demands on quality, security and higher production capacity in manufacturing increase the need for automation during the phase...

Keyphrases

efficient collision detection moving polyhedron im stadtwald first collision arbitrary positive constant project alcom ii max-planck-institut fur informatik following problem sub-quadratic running time production capacity rotational movement general polyhedron d-66123 saarbrucken running time schoemer c d-66041 saarbrucken fixed axis thiel mpi-sb esprit basic research action program translational movement

DMCA