de.mpg.escidoc.pubman.appbase.FacesBean
Deutsch
 
Hilfe Wegweiser Impressum Kontakt Einloggen
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Bericht

Efficient collision detection for moving polyhedra

MPG-Autoren
http://pubman.mpdl.mpg.de/cone/persons/resource/persons45414

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

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45612

Thiel,  Christian
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Externe Ressourcen
Es sind keine Externen Ressourcen verfügbar
Volltexte (frei zugänglich)

MPI-I-94-147.pdf
(beliebiger Volltext), 245KB

Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

Schömer, E., & Thiel, C.(1994). Efficient collision detection for moving polyhedra (MPI-I-94-147). Saarbrücken: Max-Planck-Institut für Informatik.


Zitierlink: http://hdl.handle.net/11858/00-001M-0000-0014-B52A-D
Zusammenfassung
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 + \epsilon})$ for the case of translational movements and running time $O(n^{5/3 + \epsilon})$ for rotational movements, where $\epsilon$ is an arbitrary positive constant. This is the first known algorithm with sub-quadratic running time.