Author
Joerg-Rudiger Sack
results may include different authors with the same name
1 papers
We present the first polynomial time approximation algorithm for computing shortest paths in weighted three-dimensional domains. Given a polyhedral domain $\D$, consisting of $n$ tetrahedra with positive weights, and a real number…