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.
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. :
Time-minimal paths amidst moving obstacles in three dimensions
By Fujimura K.
Theoretical Computer Science, Vol. 270, Iss. 1, 2002-01 ,pp. :
A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon
Theoretical Computer Science, Vol. 174, Iss. 1, 1997-03 ,pp. :
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. :