Efficient Algorithms for Geometric Shortest Path Query Problems
暂无分享,去创建一个
[1] Christos H. Papadimitriou,et al. An Algorithm for Shortest-Path Motion in Three Dimensions , 1985, Inf. Process. Lett..
[2] Alok Aggarwal,et al. Geometric applications of a matrix-searching algorithm , 1987, SCG '86.
[3] Joseph O'Rourke,et al. Handbook of Discrete and Computational Geometry, Second Edition , 1997 .
[4] Joseph S. B. Mitchell,et al. The Discrete Geodesic Problem , 1987, SIAM J. Comput..
[5] Mikhail J. Atallah,et al. Efficient Parallel Algorithms for String Editing and Related Problems , 1990, SIAM J. Comput..
[6] Joseph S. B. Mitchell,et al. Two-point Euclidean shortest path queries in the plane , 1999, SODA '99.
[7] Michael T. Goodrich,et al. Dynamic ray shooting and shortest paths via balanced geodesic triangulations , 1993, SCG '93.
[8] Kenneth L. Clarkson,et al. Approximation algorithms for shortest path motion planning , 1987, STOC.
[9] Kurt Mehlhorn,et al. A Faster Approximation Algorithm for the Steiner Problem in Graphs , 1988, Inf. Process. Lett..
[10] Philip N. Klein,et al. Faster Shortest-Path Algorithms for Planar Graphs , 1997, J. Comput. Syst. Sci..
[11] Esther M. Arkin,et al. Optimal link path queries in a simple polygon , 1992, SODA '92.
[12] John Hershberger,et al. A New Data Structure for Shortest Path Queries in a Simple Polygon , 1991, Inf. Process. Lett..
[13] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .
[14] Mark de Berg,et al. Computational geometry: algorithms and applications , 1997 .
[15] Micha Sharir,et al. Davenport-Schinzel sequences and their geometric applications , 1995, Handbook of Computational Geometry.
[16] Greg N. Frederickson,et al. Fast Algorithms for Shortest Paths in Planar Graphs, with Applications , 1987, SIAM J. Comput..
[17] Franz Aurenhammer,et al. Voronoi diagrams for direction-sensitive distances , 1997, SCG '97.
[18] Franz Aurenhammer,et al. Skew Voronoi Diagrams , 1999, Int. J. Comput. Geom. Appl..
[19] Joseph S. B. Mitchell. Shortest paths among obstacles in the plane , 1996, Int. J. Comput. Geom. Appl..
[20] Michel Pocchiola,et al. Computing the visibility graph via pseudo-triangulations , 1995, SCG '95.
[21] Michiel H. M. Smid,et al. Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane , 1996, ESA.
[22] Chak-Kuen Wong,et al. On Some Distance Problems in Fixed Orientations , 1987, SIAM J. Comput..
[23] Herbert Edelsbrunner,et al. Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.
[24] Xiaobo Sharon Hu,et al. Efficient approximation algorithms for floorplan area minimization , 1996, DAC '96.
[25] Mikhail J. Atallah,et al. Parallel Algorithms for Longest Increasing Chains in the Plane and Related Problems , 1999, Parallel Process. Lett..
[26] Chak-Kuen Wong,et al. Rectilinear Path Problems among Rectilinear Obstacles Revisited , 1995, SIAM J. Comput..
[27] Michael T. Goodrich,et al. Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations , 1997, J. Algorithms.
[28] Chee-Keng Yap,et al. Approximate Euclidean shortest path in 3-space , 1994, SCG '94.
[29] Uzi Vishkin,et al. On Finding Lowest Common Ancestors: Simplification and Parallelization , 1988, AWOC.
[30] Mikhail J. Atallah,et al. Computing the all-pairs longest chains in the plane , 1995, Int. J. Comput. Geom. Appl..
[31] Micha Sharir,et al. Applications of a new space-partitioning technique , 1993, Discret. Comput. Geom..
[32] Pinaki Mitra,et al. Orthogonal shortest route queries among axis parallel rectangular obstacles , 1994, Int. J. Comput. Geom. Appl..
[33] Leonidas J. Guibas,et al. Optimal Shortest Path Queries in a Simple Polygon , 1989, J. Comput. Syst. Sci..
[34] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.
[35] Sunil Arya,et al. An optimal algorithm for approximate nearest neighbor searching fixed dimensions , 1998, JACM.
[36] Joseph S. B. Mitchell,et al. Chapter 7 A survey of computational geometry , 1995 .
[37] W. Dobosiewicz. A more efficient algorithm for the min-plus multiplication , 1990 .
[38] Jirí Matousek,et al. Ray Shooting and Parametric Search , 1993, SIAM J. Comput..
[39] Yijie Han,et al. Shortest paths on a polyhedron , 1990, SCG '90.
[40] Alok Aggarwal,et al. Notes on searching in multidimensional monotone arrays , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[41] Danny Ziyi Chen,et al. Rectilinear Short Path Queries Among Rectangular Obstacles , 1996, Inf. Process. Lett..
[42] Esther M. Arkin,et al. On monotone paths among obstacles with applications to planning assemblies , 1989, SCG '89.
[43] Robert L. Scot Drysdale,et al. Voronoi diagrams based on convex distance functions , 1985, SCG '85.
[44] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .
[45] Paul Chew,et al. There are Planar Graphs Almost as Good as the Complete Graph , 1989, J. Comput. Syst. Sci..
[46] Danny Ziyi Chen,et al. On the all-pairs Euclidean short path problem , 1995, SODA '95.
[47] Sariel Har-Peled. Approximate Shortest Paths and Geodesic Diameter on a Convex Polytope in Three Dimensions , 1999, Discret. Comput. Geom..
[48] Subhash Suri,et al. An Optimal Algorithm for Euclidean Shortest Paths in the Plane , 1999, SIAM J. Comput..
[49] Pankaj K. Agarwal,et al. Ray shooting and other applications of spanning trees with low stabbing number , 1992, SCG '89.
[50] Danny Ziyi Chen. Developing algorithms and software for geometric path planning problems , 1996, CSUR.
[51] Kenneth L. Clarkson,et al. Rectilinear shortest paths through polygonal obstacles in O(n(logn)2) time , 1987, SCG '87.
[52] Michael Ben-Or,et al. Lower bounds for algebraic computation trees , 1983, STOC.
[53] Mikhail J. Atallah,et al. Applications of a Numbering Scheme for Polygonal Obstacles in the Plane , 1996, ISAAC.
[54] John F. Canny,et al. New lower bound techniques for robot motion planning problems , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[55] Mark de Berg,et al. On Rectilinear Link Distance , 1991, Comput. Geom..
[56] Chee-Keng Yap,et al. Approximate Euclidean Shortest Paths in 3-Space , 1997, Int. J. Comput. Geom. Appl..
[57] Mikhail J. Atallah,et al. Efficient Parallel Algorithms for Planar st-Graphs , 1997, Algorithmica.
[58] Philip N. Klein,et al. Faster Shortest-Path Algorithms for Planar Graphs , 1997, J. Comput. Syst. Sci..
[59] Mikhail J. Atallah,et al. On Parallel Rectilinear Obstacle- Avoiding Paths , 1993, Comput. Geom..
[60] Sariel Har-Peled. Constructing Approximate Shortest Path Maps in Three Dimensions , 1999, SIAM J. Comput..
[61] R. Tarjan,et al. A Separator Theorem for Planar Graphs , 1977 .
[62] Roberto Tamassia,et al. A unified approach to dynamic point location, ray shooting, and shortest paths in planar maps , 1996, SODA '93.
[63] Robert E. Tarjan,et al. Fast Algorithms for Finding Nearest Common Ancestors , 1984, SIAM J. Comput..
[64] Greg N. Frederickson,et al. Planar graph decomposition and all pairs shortest paths , 1991, JACM.
[65] Binay K. Bhattacharya,et al. Efficient Approximate Shortest-Path Queries Among Isothetic Rectangular Obstacles , 1993, WADS.
[66] Chak-Kuen Wong,et al. Rectilinear Paths Among Rectilinear Obstacles , 1992, Discret. Appl. Math..
[67] Sven Schuierer,et al. An optimal data structure for shortest rectilinear path queries in a simple rectilinear polygon , 1996, Int. J. Comput. Geom. Appl..
[68] Michel Pocchiola,et al. Topologically sweeping visibility complexes via pseudotriangulations , 1996, Discret. Comput. Geom..
[69] Mikhail J. Atallah,et al. Parallel Rectilinear Shortest Paths with Rectangular Obstacles , 1991, Comput. Geom..
[70] Boris Aronov,et al. Star Unfolding of a Polytope with Applications , 1997, SIAM J. Comput..
[71] Michiel H. M. Smid,et al. Euclidean spanners: short, thin, and lanky , 1995, STOC '95.
[72] Subhash Suri,et al. Efficient computation of Euclidean shortest paths in the plane , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[73] D. T. Lee,et al. Shortest rectilinear paths among weighted obstacles , 1991, Int. J. Comput. Geom. Appl..
[74] P. Pardalos,et al. Handbook of Combinatorial Optimization , 1998 .
[75] Yijie Han,et al. Shortest paths on a polyhedron , 1996, Int. J. Comput. Geom. Appl..
[76] Michel Pocchiola,et al. The visibility complex , 1993, SCG '93.
[77] Ketan Mulmuley,et al. Computational geometry : an introduction through randomized algorithms , 1993 .