|
Volumn , Issue , 1997, Pages 182-191
|
Approximating shortest paths on a nonconvex polyhedron
a a |
Author keywords
[No Author keywords available]
|
Indexed keywords
ALGORITHMS;
APPROXIMATION THEORY;
COMPUTATIONAL COMPLEXITY;
PROBLEM SOLVING;
NONCONVEX POLYHEDRON;
SHORTEST PATHS;
COMPUTATIONAL GEOMETRY;
|
EID: 0031371645
PISSN: 02725428
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
Times cited : (16)
|
References (25)
|