| dc.contributor.author | Sundaraj, Kenneth | |
| dc.contributor.author | Retnasamay, V. | |
| dc.date.accessioned | 2009-12-15T00:38:45Z | |
| dc.date.available | 2009-12-15T00:38:45Z | |
| dc.date.issued | 2007-11-25 | |
| dc.identifier.citation | p.539-542 | en_US |
| dc.identifier.isbn | 978-1-4244-1355-3 | |
| dc.identifier.uri | http://ieeexplore.ieee.org/xpls/abs_all.jsp?=&arnumber=4658446 | |
| dc.identifier.uri | http://dspace.unimap.edu.my/123456789/7419 | |
| dc.description | Link to publisher's homepage at http://ieeexplore.ieee.org | en_US |
| dc.description.abstract | This paper summarizes the prominent algorithms for computing the minimum distance between convex polyhedras. These algorithms are used in various areas such as path planning, collision detection, haptic interaction, virtual reality, etc. The algorithm of Gilbert-Johnson-Keerthi (GJK) and the algorithm of Lin-Canny (LC) are well known fast solutions to the problem. An hybrid approach which was proposed by Sundaraj-Mazer (SM) has also been shown to produce satisfactory results in terms of speed and accuracy. A review of these algorithms and their variations are presented. A critical analysis of these algorithms is also presented. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Institute of Electrical and Electronics Engineering (IEEE) | en_US |
| dc.relation.ispartofseries | Proceedings of the International Conference on Intelligent and Advanced Systems (ICIAS 2007) | en_US |
| dc.subject | Computational complexity | en_US |
| dc.subject | Minimisation | en_US |
| dc.subject | Computational geometry | en_US |
| dc.subject | Sundaraj-Mazer approach | en_US |
| dc.subject | Convex polyhedras | en_US |
| dc.subject | Algorithms | en_US |
| dc.title | Advanced computational geometry for proximity queries of convex polyhedras | en_US |
| dc.type | Working Paper | en_US |
| dc.contributor.url | kenneth@unimap.edu.my | en_US |
