Visibility of disjoint polygons
Algorithmica
On shortest paths in polyhedral spaces
SIAM Journal on Computing
SIAM Journal on Computing
New methods for computing visibility graphs
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Efficient algorithms for Euclidean shortest path and visibility problems with polygonal obstacles
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Ray shooting and other applications of spanning trees with low stabbing number
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
On maximum flows in polyhedral domains
Journal of Computer and System Sciences
Quasi-optimal upper bounds for simplex range searching and new zone theorems
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
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)
Ray shooting in polygons using Geodesic triangulations
Proceedings of the 18th international colloquium on Automata, languages and programming
An output-sensitive algorithm for computing visibility
SIAM Journal on Computing
Space-efficient ray-shooting and intersection searching: algorithms, dynamization, and applications
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Range searching with efficient hierarchical cuttings
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
Proximity and reachability in the plane.
Proximity and reachability in the plane.
Shortest path queries among weighted obstacles in the rectilinear plane
Proceedings of the eleventh annual symposium on Computational geometry
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
Two-point Euclidean shortest path queries in the plane
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Quickest paths, straight skeletons, and the city Voronoi diagram
Proceedings of the eighteenth annual symposium on Computational geometry
On Bends and Distances of Paths Among Obstacles in Two-Layer Interconnection Model
IEEE Transactions on Computers
Approximate solution of the multiple watchman routes problem with restricted visibility range
IEEE Transactions on Neural Networks
Shortest paths with arbitrary clearance from navigation meshes
Proceedings of the 2010 ACM SIGGRAPH/Eurographics Symposium on Computer Animation
Navigation queries from triangular meshes
MIG'10 Proceedings of the Third international conference on Motion in games
Shortest path in a multiply-connected domain having curved boundaries
Computer-Aided Design
A near-optimal algorithm for shortest paths among curved obstacles in the plane
Proceedings of the twenty-ninth annual symposium on Computational geometry
Rectilinear paths with minimum segment lengths
Discrete Applied Mathematics
| Hi-index | 0.00 |
We give a subquadratic (O(n5/3+&egr;) time and space) algorithm for computing Euclidean shortest paths in the plane in the presence of polygonal obstacles; previous time bounds were at least quadratic in n, in the worst-case. The method avoids use of visibility graphs, relying instead on the continuous Dijkstra paradigm. The output is a shortest path map (of size O(n)) with respect to a given source point, which allows shortest path length queries to be answered in time O(log n). The algorithm extends to the case of multiple source points, yielding a geodesic Voronoi diagram within the same time bound.