Precision-Sensitive Euclidean Shortest Path in 3-Space
From MaRDI portal
Publication:4943884
DOI10.1137/S0097539798340205zbMath0949.68072OpenAlexW2025736494MaRDI QIDQ4943884
Joonsoo Choi, Jürgen Sellen, Chee-Keng Yap
Publication date: 19 March 2000
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539798340205
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Largest and smallest convex hulls for imprecise points, An approximation algorithm for computing shortest paths in weighted 3-d domains, Recent progress in exact geometric computation, The shortest path AMID 3-D polyhedral obstacles