An augmented Voronoi roadmap for 3D translational motion planning for a convex polyhedron moving amidst convex polyhedral obstacles

Author： Dattasharma A.   Keerthi S.S.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.140, Iss.2, 1995-04, pp. : 205-230

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Can a convex polyhedron have a developable face-cycle?

By Maehara H.  

Theoretical Computer Science, Vol. 235, Iss. 2, 2000-03 ,pp. : 267-270

Elsevier

Access to resources Recommend Favorite

Time-minimal paths amidst moving obstacles in three dimensions

By Fujimura K.  

Theoretical Computer Science, Vol. 270, Iss. 1, 2002-01 ,pp. : 421-440

Elsevier

Access to resources Recommend Favorite

A 3D Convex Hull algorithm for modelling medical data in a virtual environment

By Yaacoub Fadi   Hamam Yskandar   Abche Antoine  

International Journal of Intelligent Systems Technologies and Applications, Vol. 5, Iss. 1-2, 2008-05 ,pp. : 3-19

Inderscience Publishers

Access to resources Recommend Favorite

A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon

By Berman P.   Lingas A.  

Theoretical Computer Science, Vol. 174, Iss. 1, 1997-03 ,pp. : 193-202

Elsevier

Access to resources Recommend Favorite

On fast planning of suboptimal paths amidst polygonal obstacles in plane

By Rao N.S.V.  

Theoretical Computer Science, Vol. 140, Iss. 2, 1995-04 ,pp. : 265-289

Elsevier

Access to resources Recommend Favorite