Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines
暂无分享,去创建一个
[1] Bernard Chazelle,et al. Lower bounds for intersection searching and fractional cascading in higher dimension , 2004, J. Comput. Syst. Sci..
[2] S. Muthukrishnan,et al. Efficient algorithms for document retrieval problems , 2002, SODA '02.
[3] Michiel H. M. Smid,et al. Efficient algorithms for generalized intersection searching on non-iso-oriented objects , 1994, SCG '94.
[4] Pankaj K. Agarwal,et al. Range Searching in Categorical Data: Colored Range Searching on Grid , 2002, ESA.
[5] Bernard Chazelle,et al. Lower bounds for orthogonal range searching: I. The reporting case , 1990, JACM.
[6] Sartaj Sahni,et al. Handbook of Data Structures and Applications , 2004 .
[7] Michiel H. M. Smid,et al. Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization , 1995, J. Algorithms.
[8] Mark H. Overmars,et al. Intersection Queries in Curved Objects , 1993, J. Algorithms.
[9] Bernard Chazelle,et al. Filtering search: A new approach to query-answering , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[10] Mario A. López,et al. Generalized intersection searching problems , 1993, Int. J. Comput. Geom. Appl..
[11] Robert E. Tarjan,et al. Making data structures persistent , 1986, STOC '86.
[12] Michiel H. M. Smid,et al. Computational Geometry , 2004, Handbook of Data Structures and Applications.