Approximation algorithms for shortest path motion planning
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Arrangements of curves in the plane—topology, combinatorics, and algorithms
Theoretical Computer Science
Fast Multiple-Precision Evaluation of Elementary Functions
Journal of the ACM (JACM)
Fundamental problems of algorithmic algebra
Fundamental problems of algorithmic algebra
Precision-sensitive Euclidean shortest path in 3-space (extended abstract)
Proceedings of the eleventh annual symposium on Computational geometry
d1-optimal motion for a rod (extended abstract)
Proceedings of the twelfth annual symposium on Computational geometry
Developing algorithms and software for geometric path planning problems
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
Approximate shortest paths and geodesic diameters on convex polytopes in three dimensions
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Approximating shortest paths on a convex polytope in three dimensions
Journal of the ACM (JACM)
Constructing approximate shortest path maps in three dimensions
Proceedings of the fourteenth annual symposium on Computational geometry
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Practical methods for approximating shortest paths on a convex polytope in R3
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for geometric shortest path problems
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Pseudo approximation algorithms, with applications to optimal motion planning
Proceedings of the eighteenth annual symposium on Computational geometry
Digital Curves in 3D Space and a Linear-Time Length Estimation Algorithm
IEEE Transactions on Pattern Analysis and Machine Intelligence
Shortest Anisotropic Paths on Terrains
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Approximation of 3D Shortest Polygons in Simple Cube Curves
Digital and Image Geometry, Advanced Lectures [based on a winter school held at Dagstuhl Castle, Germany in December 2000]
Approximation of 3D shortest polygons in simple cube curves
Digital and image geometry
Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon
Theoretical Computer Science - Algebraic and numerical algorithm
Fast arbitrary splitting of deforming objects
Proceedings of the 2006 ACM SIGGRAPH/Eurographics symposium on Computer animation
Analysis of the rubberband algorithm
Image and Vision Computing
Reliable Implementation of Real Number Algorithms: Theory and Practice
A Genetic Algorithm for Shortest Path Motion Problem in Three Dimensions
ICIC '07 Proceedings of the 3rd International Conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence
Interior distance using barycentric coordinates
SGP '09 Proceedings of the Symposium on Geometry Processing
Euclidean shortest paths in simple cube curves at a glance
CAIP'07 Proceedings of the 12th international conference on Computer analysis of images and patterns
Minimum-length polygons of first-class simple cube-curves
CAIP'05 Proceedings of the 11th international conference on Computer Analysis of Images and Patterns
ESA'05 Proceedings of the 13th annual European conference on Algorithms
The class of simple cube-curves whose MLPs cannot have vertices at grid points
DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery
Constant-time all-pairs geodesic distance query on triangle meshes
I3D '12 Proceedings of the ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games
Shortest paths in a cuboidal world
IWCIA'06 Proceedings of the 11th international conference on Combinatorial Image Analysis
| Hi-index | 0.00 |
Papadimitriou's approximation approach to the Euclidean shortest path (ESP) problem in 3-space is revisited. As this problem is NP-hard, his approach represents an important step towards practical algorithms. Unfortunately, there are non-trivial gaps in the original description. Besides giving a complete treatment, we also give an alternative to his subdivision method which has some nice properties. Among the tools needed are root-separation bounds and non-trivial applications of Brent's complexity bounds on evaluation of elementary functions using floating point numbers.