The Shortest Path AMID 3-D Polyhedral Obstacles
- 26 September 2021
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Finding the shortest path by evolving junctions on obstacle boundaries (E-JOB): An initial value ODEʼs approachApplied and Computational Harmonic Analysis, 2012
- A fast sweeping method for Eikonal equationsMathematics of Computation, 2004
- ON CONVEX SOBOLEV INEQUALITIES AND THE RATE OF CONVERGENCE TO EQUILIBRIUM FOR FOKKER-PLANCK TYPE EQUATIONSCommunications in Partial Differential Equations, 2001
- An Optimal Algorithm for Euclidean Shortest Paths in the PlaneSIAM Journal on Computing, 1999
- A fast marching level set method for monotonically advancing fronts.Proceedings of the National Academy of Sciences of the United States of America, 1996
- Precision-sensitive Euclidean shortest path in 3-space (extended abstract)Published by Association for Computing Machinery (ACM) ,1995
- Path planning in the presence of vertical obstaclesIEEE Transactions on Robotics and Automation, 1990
- Logarithmic Sobolev inequalities and stochastic Ising modelsJournal of Statistical Physics, 1987
- On shortest paths amidst convex polyhedraPublished by Association for Computing Machinery (ACM) ,1986
- An algorithm for shortest-path motion in three dimensionsInformation Processing Letters, 1985