Fully Dynamic Point Location in a Monotone Subdivision
暂无分享,去创建一个
[1] Franco P. Preparata,et al. A New Approach to Planar Point Location , 1981, SIAM J. Comput..
[2] F. Frances Yao,et al. Computational Geometry , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[3] Kurt Mehlhorn,et al. Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry , 2012, EATCS Monographs on Theoretical Computer Science.
[4] Kurt Mehlhorn,et al. Dynamization of geometric data structures , 1985, SCG '85.
[5] Tiko Kameda,et al. On the Vector Representation of the Reachability in Planar Directed Graphs , 1975, Inf. Process. Lett..
[6] Leonidas J. Guibas,et al. A dichromatic framework for balanced trees , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).
[7] Franco P. Preparata,et al. Planar Point Location Revisited (A Guided Tour of a Decade of Research) , 1988, FSTTCS.
[8] Kurt Mehlhorn,et al. Multi-dimensional searching and computational geometry , 1984 .
[9] Mark H. Overmars,et al. Range searching in a set of line segments , 1985, SCG '85.
[10] Leonidas J. Guibas,et al. Optimal Point Location in a Monotone Subdivision , 1986, SIAM J. Comput..
[11] Richard J. Lipton,et al. Multidimensional Searching Problems , 1976, SIAM J. Comput..
[12] Robert E. Tarjan,et al. Planar point location using persistent search trees , 1986, CACM.
[13] D. T. Lee,et al. Location of a point in a planar subdivision and its applications , 1976, STOC '76.
[14] David G. Kirkpatrick,et al. Optimal Search in Planar Subdivisions , 1983, SIAM J. Comput..
[15] Takao Asano,et al. A new point-location algorithm and its practical efficiency: comparison with existing algorithms , 1984, TOGS.
[16] Robert E. Tarjan,et al. Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.
[17] Robert E. Tarjan,et al. Applications of a planar separator theorem , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).