Show simple item record

dc.contributor.authorSundaraj, Kenneth
dc.contributor.authorRetnasamay, V.
dc.date.accessioned2009-12-15T00:38:45Z
dc.date.available2009-12-15T00:38:45Z
dc.date.issued2007-11-25
dc.identifier.citationp.539-542en_US
dc.identifier.isbn978-1-4244-1355-3
dc.identifier.urihttp://ieeexplore.ieee.org/xpls/abs_all.jsp?=&arnumber=4658446
dc.identifier.urihttp://dspace.unimap.edu.my/123456789/7419
dc.descriptionLink to publisher's homepage at http://ieeexplore.ieee.orgen_US
dc.description.abstractThis 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.isoenen_US
dc.publisherInstitute of Electrical and Electronics Engineering (IEEE)en_US
dc.relation.ispartofseriesProceedings of the International Conference on Intelligent and Advanced Systems (ICIAS 2007)en_US
dc.subjectComputational complexityen_US
dc.subjectMinimisationen_US
dc.subjectComputational geometryen_US
dc.subjectSundaraj-Mazer approachen_US
dc.subjectConvex polyhedrasen_US
dc.subjectAlgorithmsen_US
dc.titleAdvanced computational geometry for proximity queries of convex polyhedrasen_US
dc.typeWorking Paperen_US
dc.contributor.urlkenneth@unimap.edu.myen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record