Shortest path queries among weighted obstacles in the rectilinear plane

Authors:
Danny Z. Chen;Kevin S. Klenk;Hung-Yi T. Tu
Affiliations:
Department of Computer Science and Engineering, University, of Notre Dame, Notre Dame, IN;Department of Computer Science and Engineering, University, of Notre Dame, Notre Dame, IN;Department of Computer Science and Information Management, Providence University, Shalu, Taichung Hsien, 43309, Taiwan, R. O. C.
Venue:
Proceedings of the eleventh annual symposium on Computational geometry
Year:
1995

Citing 17
Cited 2

Computational geometry: an introduction

Computational geometry: an introduction
Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles

IEEE Transactions on Computers
Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
Optimal shortest path queries in a simple polygon

SCG '87 Proceedings of the third annual symposium on Computational geometry
Rectilinear shortest paths through polygonal obstacles in O(n(logn)2) time

SCG '87 Proceedings of the third annual symposium on Computational geometry
Path planning in 0/1/ weighted regions with applications

SCG '88 Proceedings of the fourth annual symposium on Computational geometry
The weighted region problem: finding shortest paths through a weighted planar subdivision

Journal of the ACM (JACM)
Shortest rectilinear paths among weighted rectangles

Journal of Information Processing
Shortest path queries in rectilinear worlds of higher dimension (extended abstract)

SCG '91 Proceedings of the seventh annual symposium on Computational geometry
A new data structure for shortest path queries in a simple polygon

Information Processing Letters
Parallel rectilinear shortest paths with rectangular obstacles

Computational Geometry: Theory and Applications
Shortest paths among obstacles in the plane

SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Dynamic ray shooting and shortest paths via balanced geodesic triangulations

SCG '93 Proceedings of the ninth annual symposium on Computational geometry
On parallel rectilinear obstacle-avoiding paths

Computational Geometry: Theory and Applications
Shortest paths in the plane with polygonal obstacles

Journal of the ACM (JACM)
A unified approach to dynamic point location, ray shooting, and shortest paths in planar maps

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
On the all-pairs Euclidean short path problem

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms

A new algorithm for computing shortest paths in weighted planar subdivisions (extended abstract)

SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Shortest path queries in planar graphs

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Shortest path queries among weighted obstacles in the rectilinear plane

Quantified Score

Visualization

Abstract