An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Lyudmil Aleksandrov, Hristo Djidjev, Anil Maheshwari, Jörg-Rüdiger Sack. An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains. Discrete & Computational Geometry, 50(1):124-184, 2013. [doi]

This author has not been identified. Look up 'Lyudmil Aleksandrov' in GoogleThis author has not been identified. Look up 'Hristo Djidjev' in GoogleThis author has not been identified. Look up 'Anil Maheshwari' in GoogleThis author has not been identified. Look up 'Jörg-Rüdiger Sack' in Google

runs on WebDSL