Visibility of disjoint polygons
Algorithmica
On shortest paths in polyhedral spaces
SIAM Journal on Computing
SIAM Journal on Computing
SCG '87 Proceedings of the third annual symposium on Computational geometry
Generalized unfoldings for shortest paths
International Journal of Robotics Research
An algorithmic approach to some problems in terrain navigation
Artificial Intelligence - Special issue on geometric reasoning
Efficient algorithms for Euclidean shortest path and visibility problems with polygonal obstacles
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Deterministic minimal time vessel routing
Operations Research
Shortest rectilinear paths among weighted obstacles
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
International Journal of Robotics Research
International Journal of Robotics Research
Primitives for the manipulation of general subdivisions and the computation of Voronoi
ACM Transactions on Graphics (TOG)
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Proximity and reachability in the plane.
Proximity and reachability in the plane.
Shortest paths among obstacles in the plane
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Shortest paths in the plane with polygonal obstacles
Journal of the ACM (JACM)
Shortest path queries among weighted obstacles in the rectilinear plane
Proceedings of the eleventh 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
Voronoi diagrams for direction-sensitive distances
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
Determining an optimal penetration among weighted regions in two and three dimensions
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Approximation algorithms for geometric shortest path problems
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Quickest paths, straight skeletons, and the city Voronoi diagram
Proceedings of the eighteenth annual symposium on Computational geometry
Adaptive Routing for Road Traffic
IEEE Computer Graphics and Applications
Improved Optimal Weighted Links Algorithms
ICCS '02 Proceedings of the International Conference on Computational Science-Part III
Parallel Optimal Weighted Links
ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
Movement Planning in the Presence of Flows
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Shortest Anisotropic Paths on Terrains
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Movement behavior for soldier agents on a virtual battlefield
Presence: Teleoperators and Virtual Environments - Fourth international workshop on presence
Parallel implementation of geometric shortest path algorithms
Parallel Computing - Special issue: High performance computing with geographical data
Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon
Theoretical Computer Science - Algebraic and numerical algorithm
Determining approximate shortest paths on weighted polyhedral surfaces
Journal of the ACM (JACM)
1-link shortest paths in weighted regions
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Calculating the meeting point of scattered robots on weighted terrain surfaces
CATS '05 Proceedings of the 2005 Australasian symposium on Theory of computing - Volume 41
The transportation metric and related problems
Information Processing Letters
Approximating minimum-cost polygonal paths of bounded number of links in weighted subdivisions
Proceedings of the twenty-second annual symposium on Computational geometry
On finding approximate optimal paths in weighted regions
Journal of Algorithms
On discretization methods for approximating optimal paths in regions with direction-dependent costs
Information Processing Letters
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
Querying approximate shortest paths in anisotropic regions
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Approximate shortest paths in anisotropic regions
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Line Facility Location in Weighted Regions
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Finding rectilinear least cost paths in the presence of convex polygonal congested regions
Computers and Operations Research
Region-restricted clustering for geographic data mining
Computational Geometry: Theory and Applications
Shortest Gently Descending Paths
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Shortest descending paths through given faces
Computational Geometry: Theory and Applications
Parallel Optimal Weighted Links
Transactions on Computational Science III
Robot Navigation in Multi-terrain Outdoor Environments
International Journal of Robotics Research
Line Segment Facility Location in Weighted Subdivisions
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Theta*: any-angle path planning on grids
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
An integrated control system architecture for autonomous vehicles
ISC '07 Proceedings of the 10th IASTED International Conference on Intelligent Systems and Control
A Survey of Motion Planning Algorithms from the Perspective of Autonomous UAV Guidance
Journal of Intelligent and Robotic Systems
Fréchet Distance Problems in Weighted Regions
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
The transportation metric and related problems
Information Processing Letters
On discretization methods for approximating optimal paths in regions with direction-dependent costs
Information Processing Letters
On finding approximate optimal paths in weighted regions
Journal of Algorithms
Approximation algorithms for shortest descending paths in terrains
Journal of Discrete Algorithms
Sculpting potential fields in the BVP path planner
ROBIO'09 Proceedings of the 2009 international conference on Robotics and biomimetics
Geometric optimization and sums of algebraic functions
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
COIN'09 Proceedings of the 5th international conference on Coordination, organizations, institutions, and norms in agent systems
Geodesic Methods in Computer Vision and Graphics
Foundations and Trends® in Computer Graphics and Vision
Theta*: any-angle path planning on grids
Journal of Artificial Intelligence Research
Querying Approximate Shortest Paths in Anisotropic Regions
SIAM Journal on Computing
wNeighbors: a method for finding k nearest neighbors in weighted regions
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II
Line facility location in weighted regions
Journal of Combinatorial Optimization
A survey of geodesic paths on 3D surfaces
Computational Geometry: Theory and Applications
Quickest paths in anisotropic media
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Approximate distance queries for weighted polyhedral surfaces
ESA'11 Proceedings of the 19th European conference on Algorithms
On the complexity of time-dependent shortest paths
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Shortest monotone descent path problem in polyhedral terrain
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
k-link shortest paths in weighted subdivisions
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Voronoi diagrams with a transportation network on the euclidean plane
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Farthest voronoi diagrams under travel time metrics
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Approximating generalized distance functions on weighted triangulated surfaces with applications
Journal of Computational and Applied Mathematics
Application of the fast marching method for outdoor motion planning in robotics
Robotics and Autonomous Systems
An algorithm for map matching given incomplete road data
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Field D* path-finding on weighted triangulated and tetrahedral meshes
Autonomous Agents and Multi-Agent Systems
Fast query structures in anisotropic media
Theoretical Computer Science
Geometric optimization and sums of algebraic functions
ACM Transactions on Algorithms (TALG)
Hi-index | 0.01 |
The problem of determining shortest paths through a weighted planar polygonal subdivision with n vertices is considered. Distances are measured according to a weighted Euclidean metric: The length of a path is defined to be the weighted sum of (Euclidean) lengths of the subpaths within each region. An algorithm that constructs a (restricted) “shortest path map” with respect to a given source point is presented. The output is a partitioning of each edge of the subdivion into intervals of &egr;-optimality, allowing an &egr;-optimal path to be traced from the source to any query point along any edge. The algorithm runs in worst-case time O(ES) and requires O(E) space, where E is the number of “events” in our algorithm and S is the time it takes to run a numerical search procedure. In the worst case, E is bounded above by O(n4) (and we give an &OHgr;(n4) lower bound), but it is likeky that E will be much smaller in practice. We also show that S is bounded by O(n4L), where L is the precision of the problem instance (including the number of bits in the user-specified tolerance &egr;). Again, the value of S should be smaller in practice. The algorithm applies the “continuous Dijkstra” paradigm and exploits the fact that shortest paths obey Snell's Law of Refraction at region boundaries, a local optimaly property of shortest paths that is well known from the analogous optics model. The algorithm generalizes to the multi-source case to compute Voronoi diagrams.