Please use this identifier to cite or link to this item:
http://dspace.unimap.edu.my:80/xmlui/handle/123456789/7419
Title: | Advanced computational geometry for proximity queries of convex polyhedras |
Authors: | Sundaraj, Kenneth Retnasamay, V. kenneth@unimap.edu.my |
Keywords: | Computational complexity Minimisation Computational geometry Sundaraj-Mazer approach Convex polyhedras Algorithms |
Issue Date: | 25-Nov-2007 |
Publisher: | Institute of Electrical and Electronics Engineering (IEEE) |
Citation: | p.539-542 |
Series/Report no.: | Proceedings of the International Conference on Intelligent and Advanced Systems (ICIAS 2007) |
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. |
Description: | Link to publisher's homepage at http://ieeexplore.ieee.org |
URI: | http://ieeexplore.ieee.org/xpls/abs_all.jsp?=&arnumber=4658446 http://dspace.unimap.edu.my/123456789/7419 |
ISBN: | 978-1-4244-1355-3 |
Appears in Collections: | Conference Papers Kenneth Sundaraj, Assoc. Prof. Dr. |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Abstract.pdf | 7 kB | Adobe PDF | View/Open |
Items in UniMAP Library Digital Repository are protected by copyright, with all rights reserved, unless otherwise indicated.