Approximate Euclidean Shortest Paths in 3-Space
From MaRDI portal
Publication:4354005
DOI10.1142/S0218195997000181zbMath0883.68116MaRDI QIDQ4354005
Jürgen Sellen, Joonsoo Choi, Chee-Keng Yap
Publication date: 16 March 1998
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Related Items (7)
Robustness and Randomness ⋮ An approximation algorithm for computing shortest paths in weighted 3-d domains ⋮ Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon ⋮ Relative convex hulls in semi-dynamic arrangements ⋮ Approximate convex decomposition of polyhedra and its applications ⋮ EXACT AND APPROXIMATION ALGORITHMS FOR FINDING AN OPTIMAL BRIDGE CONNECTING TWO SIMPLE POLYGONS ⋮ An approximation algorithm ford1-optimal motion of a rod robot with fixed rotations
This page was built for publication: Approximate Euclidean Shortest Paths in 3-Space
