Efficient computation of Euclidean shortest paths in the plane
暂无分享,去创建一个
[1] S. N. Maheshwari,et al. Efficient algorithms for Euclidean shortest path and visibility problems with polygonal obstacles , 1988, SCG '88.
[2] Mark H. Overmars,et al. New methods for computing visibility graphs , 1988, SCG '88.
[3] David M. Mount,et al. An Output Sensitive Algorithm for Computing Visibility Graphs , 1987, FOCS.
[4] Joseph S. B. Mitchell,et al. Shortest paths among obstacles in the plane , 1993, SCG '93.
[5] John Hershberger,et al. Computing Minimum Length Paths of a Given Homotopy Class (Extended Abstract) , 1991, WADS.
[6] T. Asano. An Efficient Algorithm for Finding the Visibility Polygon for a Polygonal Region with Holes , 1985 .
[7] Bernard Chazelle,et al. A theorem on polygon cutting with applications , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[8] Hans Rohnert,et al. Shortest Paths in the Plane with Convex Polygonal Obstacles , 1986, Inf. Process. Lett..
[9] Joseph S. B. Mitchell,et al. The weighted region problem: finding shortest paths through a weighted planar subdivision , 1991, JACM.
[10] Joseph S. B. Mitchell,et al. The Discrete Geodesic Problem , 1987, SIAM J. Comput..
[11] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[12] D. T. Lee,et al. Euclidean shortest paths in the presence of rectilinear barriers , 1984, Networks.
[13] David Eppstein,et al. Provably Good Mesh Generation , 1994, J. Comput. Syst. Sci..
[14] Jan van Leeuwen,et al. Maintenance of Configurations in the Plane , 1981, J. Comput. Syst. Sci..
[15] J. Reif,et al. Shortest Paths in Euclidean Space with Polyhedral Obstacles. , 1985 .
[16] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[17] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.
[18] David M. Mount,et al. An output sensitive algorithm for computing visibility graphs , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).