Point Location in Fat Subdivisions
暂无分享,去创建一个
[1] Kurt Mehlhorn,et al. Bounded Ordered Dictionaries in O(log log N) Time and O(n) Space , 1990, Information Processing Letters.
[2] Mark H. Overmars,et al. The Complexity of the Free Space for a Robot Moving Amidst Fat Obstacles , 1992, Comput. Geom..
[3] Micha Sharir,et al. Fat Triangles Determine Linearly Many Holes , 1994, SIAM J. Comput..
[4] Herbert Edelsbrunner,et al. Rectangular Point Location in d Dimensions with Applications , 1986, Comput. J..
[5] János Komlós,et al. Storing a sparse table with O(1) worst case access time , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[6] Michael T. Goodrich,et al. Dynamic trees and dynamic point location , 1991, STOC '91.
[7] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .
[8] Franco P. Preparata. Planar Point Location Revisited (Review Paper) , 1990, Int. J. Found. Comput. Sci..