Dynamic point location in general subdivisions
暂无分享,去创建一个
[1] George S. Lueker,et al. A data structure for orthogonal range queries , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).
[2] Alfred V. Aho,et al. Data Structures and Algorithms , 1983 .
[3] Kurt Mehlhorn,et al. On the Average Number of Rebalancing Operations in Weight-Balanced Trees , 1980, Theor. Comput. Sci..
[4] Roberto Tamassia,et al. Dynamization of the trapezoid method for planar point location (extended abstract) , 1991, SCG '91.
[5] George S. Lueker,et al. Adding range restriction capability to dynamic data structures , 1985, JACM.
[6] Edward M. Reingold,et al. Binary Search Trees of Bounded Balance , 1973, SIAM J. Comput..
[7] Roberto Tamassia,et al. Dynamization of the trapezoid method for planar point location in monotone subdivisions , 1992, Int. J. Comput. Geom. Appl..
[8] Edward M. Reingold,et al. Binary search trees of bounded balance , 1972, SIAM J. Comput..
[9] Roberto Tamassia,et al. Fully Dynamic Point Location in a Monotone Subdivision , 1989, SIAM J. Comput..
[10] Mark H. Overmars,et al. Range searching in a set of line segments , 1985, SCG '85.