A new approach to rectangle intersections part I
暂无分享,去创建一个
[1] Dan E. Willard,et al. New Data Structures for Orthogonal Queries. , 1979 .
[2] Jon Louis Bentley,et al. Decomposable Searching Problems , 1979, Inf. Process. Lett..
[3] Derick Wood,et al. The rectangle intersection problem revisited , 1980, BIT.
[4] Derick Wood,et al. An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles , 1980, IEEE Transactions on Computers.
[5] Michael L. Fredman,et al. A Lower Bound on the Complexity of Orthogonal Range Queries , 1981, JACM.
[6] Chak-Kuen Wong,et al. Finding Intersection of Rectangles by Range Search , 1981, J. Algorithms.
[7] Derick Wood,et al. Counting and Reporting Intersections of d-Ranges , 1982, IEEE Transactions on Computers.