On Bounded Leg Shortest Paths Problems
暂无分享,去创建一个
[1] Micha Sharir,et al. Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications , 1999, SIAM J. Comput..
[2] Subhash Suri,et al. Applications of a semi-dynamic convex hull algorithm , 1992, BIT Comput. Sci. Sect..
[3] Pravin M. Vaidya,et al. A sparse graph almost as good as the complete graph on points inK dimensions , 1991, Discret. Comput. Geom..
[4] Sariel Har-Peled,et al. Fly cheaply: on the minimum fuel-consumption problem , 1998, SCG '98.
[5] R. Pollack,et al. Advances in Discrete and Computational Geometry , 1999 .
[6] B.,et al. Halfspace Range Search : An Algorithmic Application of k-Sets , 2022 .
[7] Michiel H. M. Smid,et al. Dynamic algorithms for geometric spanners of small diameter: Randomized solutions , 1999, Comput. Geom..
[8] J. Sack,et al. Handbook of computational geometry , 2000 .
[9] David Peleg,et al. (1+epsilon, beta)-Spanner Constructions for General Graphs , 2004, SIAM J. Comput..
[10] Timothy M. Chan. A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries , 2006, SODA '06.
[11] Mikkel Thorup,et al. Approximate distance oracles , 2001, JACM.
[12] David Eppstein,et al. Dynamic Euclidean minimum spanning trees and extrema of binary functions , 1995, Discret. Comput. Geom..
[13] Sandeep Sen,et al. A Simple Linear Time Algorithm for Computing a (2k-1)-Spanner of O(n1+1/k) Size in Weighted Graphs , 2003, ICALP.
[14] Michiel H. M. Smid,et al. New techniques for exact and approximate dynamic closest-point problems , 1994, SCG '94.
[15] Bernard Chazelle,et al. On the convex layers of a planar set , 1985, IEEE Trans. Inf. Theory.
[16] P. Giblin. Computational geometry: algorithms and applications (2nd edn.), by M. de Berg, M. van Kreveld, M. Overmars and O. Schwarzkopf. Pp. 367. £20.50. 2000. ISBN 3 540 65620 0 (Springer-Verlag). , 2001, The Mathematical Gazette.
[17] Pankaj K. Agarwal,et al. Geometric Range Searching and Its Relatives , 2007 .
[18] Michiel H. M. Smid,et al. Euclidean spanners: short, thin, and lanky , 1995, STOC '95.
[19] Timothy M. Chan,et al. Fly Cheaply: On the Minimum Fuel Consumption Problem , 2001, J. Algorithms.
[20] Giri Narasimhan,et al. Approximating Geometric Bottleneck Shortest Paths , 2003, STACS.
[21] S. Rao Kosaraju,et al. A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields , 1995, JACM.
[22] Jon Louis Bentley,et al. Decomposable Searching Problems I: Static-to-Dynamic Transformation , 1980, J. Algorithms.
[23] Uri Zwick,et al. All pairs shortest paths using bridging sets and rectangular matrix multiplication , 2000, JACM.
[24] Mikkel Thorup,et al. Undirected single-source shortest paths with positive integer weights in linear time , 1999, JACM.
[25] Alok Aggarwal,et al. Solving query-retrieval problems by compacting Voronoi diagrams , 1990, STOC '90.
[26] Timothy M. Chan. Dynamic planar convex hull operations in near-logarithmic amortized time , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[27] Seth Pettie,et al. A new approach to all-pairs shortest paths on real-weighted graphs , 2004, Theor. Comput. Sci..
[28] David Eppstein,et al. Spanning Trees and Spanners , 2000, Handbook of Computational Geometry.
[29] Jirí Matousek,et al. Efficient partition trees , 1992, Discret. Comput. Geom..
[30] Mark de Berg,et al. Computational geometry: algorithms and applications , 1997 .
[31] Michiel H. M. Smid,et al. New Techniques for Exact and Approximate Dynamic Closest-Point Problems , 1996, SIAM J. Comput..