Abstract
This paper presents an approximation algorithm for finding minimum cost path between two points on the surface of a weighted polyhedron in 3D. It terminates in finite time. For a restricted class of polyhedron better approximation bound can be obtained. © Springer-Verlag Berlin Heidelberg 2004.
Cite
CITATION STYLE
APA
Roy, S., Das, S., & Nandy, S. C. (2004). A practical algorithm for approximating shortest weighted path between a pair of points on polyhedral surface. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3045, 42–52. https://doi.org/10.1007/978-3-540-24767-8_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free