Collision Detection for Moving Polyhedra
dc.date.accessioned | 2004-10-01T20:17:19Z | |
dc.date.accessioned | 2018-11-24T10:09:47Z | |
dc.date.available | 2004-10-01T20:17:19Z | |
dc.date.available | 2018-11-24T10:09:47Z | |
dc.date.issued | 1984-10-01 | en_US |
dc.identifier.uri | http://hdl.handle.net/1721.1/5621 | |
dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/1721.1/5621 | |
dc.description.abstract | We consider the problem of moving a three dimensional solid object among polyhedral obstacles. The traditional formulation of configuration space for this problem uses three translational parameters and three angles (typically Euler angles), and the constraints between the object and obstacles involve transcendental functions. We show that a quaternion representation of rotation yields constraints which are purely algebraic in a higher-dimensional space. By simple manipulation, the constraints may be projected down into a six dimensional space with no increase in complexity. Using this formulation, we derive an efficient exact intersection test for an object which is translating and rotating among obstacles. | en_US |
dc.format.extent | 17 p. | en_US |
dc.format.extent | 1836593 bytes | |
dc.format.extent | 1296892 bytes | |
dc.language.iso | en_US | |
dc.subject | collision detection | en_US |
dc.subject | collision avoidance | en_US |
dc.subject | motion planning | en_US |
dc.subject | srobotics | en_US |
dc.subject | geometric modelling | en_US |
dc.title | Collision Detection for Moving Polyhedra | en_US |
Files in this item
Files | Size | Format | View |
---|---|---|---|
AIM-806.pdf | 1.296Mb | application/pdf | View/ |
AIM-806.ps | 1.836Mb | application/postscript | View/ |