Approximation algorithms for shortest path motion planning
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
On shortest paths amidst convex polyhedra
SIAM Journal on Computing
Shortest paths on a polyhedron
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
The weighted region problem: finding shortest paths through a weighted planar subdivision
Journal of the ACM (JACM)
Convex decomposition of polyhedra and robustness
SIAM Journal on Computing
Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
Approximate Euclidean shortest path in 3-space
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
A new algorithm for computing shortest paths in weighted planar subdivisions (extended abstract)
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Approximating weighted shortest paths on polyhedral surfaces
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Erased arrangements of lines and convex decompositions of polyhedra
Computational Geometry: Theory and Applications
Efficient computation of geodesic shortest paths
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
An epsilon-Approximation for Weighted Shortest Paths on Polyhedral Surfaces
SWAT '98 Proceedings of the 6th Scandinavian Workshop on Algorithm Theory
Approximating Shortest Paths on a Nonconvex Polyhedron
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Shortest path problems on polyhedral surfaces
Shortest path problems on polyhedral surfaces
Movement Planning in the Presence of Flows
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
BUSHWHACK: An Approximation Algorithm for Minimal Paths through Pseudo-Euclidean Spaces
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Parallel implementation of geometric shortest path algorithms
Parallel Computing - Special issue: High performance computing with geographical data
Determining approximate shortest paths on weighted polyhedral surfaces
Journal of the ACM (JACM)
Energy-aware stage illumination
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
On finding approximate optimal paths in weighted regions
Journal of Algorithms
Finding optimal weighted bridges with applications
Proceedings of the 44th annual Southeast regional conference
Shortest monotone descent path problem in polyhedral terrain
Computational Geometry: Theory and Applications
Journal of Mathematical Imaging and Vision
Approximate shortest paths in anisotropic regions
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Parallel Optimal Weighted Links
Transactions on Computational Science III
Line Segment Facility Location in Weighted Subdivisions
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Fréchet Distance Problems in Weighted Regions
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
On finding approximate optimal paths in weighted regions
Journal of Algorithms
Approximation algorithms for shortest descending paths in terrains
Journal of Discrete Algorithms
Approximate shortest paths in simple polyhedra
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
Line facility location in weighted regions
Journal of Combinatorial Optimization
A survey of geodesic paths on 3D surfaces
Computational Geometry: Theory and Applications
Shortest monotone descent path problem in polyhedral terrain
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Approximating generalized distance functions on weighted triangulated surfaces with applications
Journal of Computational and Applied Mathematics
Direct multiple shooting method for solving approximate shortest path problems
Journal of Computational and Applied Mathematics
Field D* path-finding on weighted triangulated and tetrahedral meshes
Autonomous Agents and Multi-Agent Systems
Computing highly occluded paths on a terrain
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
| Hi-index | 0.00 |