Precision-Sensitive Euclidean Shortest Path in 3-Space

DOI10.1137/S0097539798340205MaRDI QIDQ4943884zbMATH OpenOpenAlexFDO

Authors Jürgen Sellen, Joonsoo Choi, Chee K. 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

zbMATH Keywords

bit complexityexact geometric algorithmsprecision-sensitivityshortest path

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Approximate Euclidean Shortest Paths in 3-Space
• An Optimal Algorithm for Euclidean Shortest Paths in the Plane
• Euclidean shortest paths. Exact or approximate algorithms.
• Approximation algorithms for geometric shortest path problems
• Efficient computation of geodesic shortest paths

Cited in

(5)

• Recent progress in exact geometric computation
• Three-dimensional Euclidean distance transformation and its application to shortest path planning
• The shortest path AMID 3-D polyhedral obstacles
• An approximation algorithm for computing shortest paths in weighted 3-d domains
• Largest and smallest convex hulls for imprecise points

This page was built for publication: Precision-Sensitive Euclidean Shortest Path in 3-Space

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4943884)