Cover Image

Advanced computational geometry for proximity queries of convex polyhedras

Link to publisher's homepage at http://ieeexplore.ieee.org

Saved in:
Bibliographic Details
Main Authors: Sundaraj, Kenneth, Retnasamay, V.
Other Authors: kenneth@unimap.edu.my
Format: Working Paper
Language:English
Published: Institute of Electrical and Electronics Engineering (IEEE) 2009
Subjects:
Computational complexity
Minimisation
Computational geometry
Sundaraj-Mazer approach
Convex polyhedras
Algorithms
Online Access:http://dspace.unimap.edu.my/xmlui/handle/123456789/7419
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.unimap-7419
record_format dspace
spelling my.unimap-74192010-11-24T02:23:47Z Advanced computational geometry for proximity queries of convex polyhedras Sundaraj, Kenneth Retnasamay, V. kenneth@unimap.edu.my Computational complexity Minimisation Computational geometry Sundaraj-Mazer approach Convex polyhedras Algorithms Link to publisher's homepage at http://ieeexplore.ieee.org 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. 2009-12-15T00:38:45Z 2009-12-15T00:38:45Z 2007-11-25 Working Paper p.539-542 978-1-4244-1355-3 http://ieeexplore.ieee.org/xpls/abs_all.jsp?=&arnumber=4658446 http://hdl.handle.net/123456789/7419 en Proceedings of the International Conference on Intelligent and Advanced Systems (ICIAS 2007) Institute of Electrical and Electronics Engineering (IEEE)
institution Universiti Malaysia Perlis
building UniMAP Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Malaysia Perlis
content_source UniMAP Library Digital Repository
url_provider http://dspace.unimap.edu.my/
language English
topic Computational complexity
Minimisation
Computational geometry
Sundaraj-Mazer approach
Convex polyhedras
Algorithms
spellingShingle Computational complexity
Minimisation
Computational geometry
Sundaraj-Mazer approach
Convex polyhedras
Algorithms
Sundaraj, Kenneth
Retnasamay, V.
Advanced computational geometry for proximity queries of convex polyhedras
description Link to publisher's homepage at http://ieeexplore.ieee.org
author2 kenneth@unimap.edu.my
author_facet kenneth@unimap.edu.my
Sundaraj, Kenneth
Retnasamay, V.
format Working Paper
author Sundaraj, Kenneth
Retnasamay, V.
author_sort Sundaraj, Kenneth
title Advanced computational geometry for proximity queries of convex polyhedras
title_short Advanced computational geometry for proximity queries of convex polyhedras
title_full Advanced computational geometry for proximity queries of convex polyhedras
title_fullStr Advanced computational geometry for proximity queries of convex polyhedras
title_full_unstemmed Advanced computational geometry for proximity queries of convex polyhedras
title_sort advanced computational geometry for proximity queries of convex polyhedras
publisher Institute of Electrical and Electronics Engineering (IEEE)
publishDate 2009
url http://dspace.unimap.edu.my/xmlui/handle/123456789/7419
_version_ 1643788809022734336
score 13.214268

Similar Items