Shortest paths among obstacles in the plane
暂无分享,去创建一个
[1] David M. Mount,et al. An Output Sensitive Algorithm for Computing Visibility Graphs , 1987, FOCS.
[2] David G. Kirkpatrick,et al. Efficient computation of continuous skeletons , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[3] Emo WELZL,et al. Constructing the Visibility Graph for n-Line Segments in O(n²) Time , 1985, Inf. Process. Lett..
[4] Micha Sharir,et al. On shortest paths in polyhedral spaces , 1986, STOC '84.
[5] Der-Tsai Lee. Proximity and reachability in the plane. , 1978 .
[6] Bernard Chazelle,et al. Quasi-optimal upper bounds for simplex range searching and new zone theorems , 1990, SCG '90.
[7] J. Reif,et al. Shortest Paths in Euclidean Space with Polyhedral Obstacles. , 1985 .
[8] Nimrod Megiddo,et al. Applying parallel computation algorithms in the design of serial algorithms , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[9] David M. Mount,et al. An output sensitive algorithm for computing visibility graphs , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[10] Joseph S. B. Mitchell,et al. The Discrete Geodesic Problem , 1987, SIAM J. Comput..
[11] Joseph S. B. Mitchell,et al. Path Planning in 0/1/ Weighted Regions with Applications , 1990, INFORMS J. Comput..
[12] Joseph S. B. Mitchell,et al. On maximum flows in polyhedral domains , 1988, SCG '88.
[13] Pankaj K. Agarwal. Ray shooting and other applications of spanning trees with low stabbing number , 1989, SCG '89.
[14] Joseph S. B. Mitchell,et al. Path planning in 0/1/ weighted regions with applications , 1988, SCG '88.
[15] D. T. Lee,et al. Euclidean shortest paths in the presence of rectilinear barriers , 1984, Networks.
[16] Leonidas J. Guibas,et al. Ray Shooting in Polygons Using Geodesic Triangulations , 1991, ICALP.
[17] Jirí Matousek. Range searching with efficient hierarchical cuttings , 1992, SCG '92.
[18] S. N. Maheshwari,et al. Efficient algorithms for Euclidean shortest path and visibility problems with polygonal obstacles , 1988, SCG '88.
[19] Siu-Wing Cheng,et al. Space-efficient ray-shooting and intersection searching: algorithms, dynamization, and applications , 1991, SODA '91.
[20] Yijie Han,et al. Shortest paths on a polyhedron , 1990, SCG '90.
[21] Joseph S. B. Mitchell,et al. The weighted region problem: finding shortest paths through a weighted planar subdivision , 1991, JACM.
[22] Mark H. Overmars,et al. New methods for computing visibility graphs , 1988, SCG '88.