Approximating weighted shortest paths on polyhedral surfaces

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 1997, Pages 485-486

  Lanthier, Mark ^a   Maheshwari, Anil ^a   Sack, Jorg Rudiger ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; GRAPH THEORY; PROBLEM SOLVING;

EUCLIDEAN SHORTEST PATHS; NONCONVEX POLYHEDRA; SHORTEST PATH ALGORITHM; TRIANGULAR IRREGULAR NETWORK (TIN); WEIGHTED REGION PROBLEM;

COMPUTATIONAL GEOMETRY;

EID: 0030697703     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/262839.263101     Document Type: Conference Paper

References (6)