35 citations · 40 across the 10 of their papers we have counts for
1 paper · 1 filter
Lyudmil Aleksandrov, Hristo Djidjev, Anil Maheshwari +1
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 t…