New upper bounds for generalized intersection searching problems
Generalized intersection searching problems is a class of problems that constitute an extension of their standard counterparts. In such problems, we are given a set of colored objects and we want to report or count the distinct colors of the objects intersected by a query object. Many solutions have appeared for both iso-oriented and non-iso-oriented objects. We show how to improve the bounds of several generalized intersection searching problems as well as how to obtain upper bounds for some problems not treated before.
Unable to display preview. Download preview PDF.
- 1.B. Chazelle. A functional approach to data structures and its use in multidimensional searching. SIAM Journal on Computing 17, 3,427–462 (1988)Google Scholar
- 2.B. Chazelle and H. Edelsbrunner. An optimal algorithm for intersecting line segments in the plane. Journal of the ACM, 39,1,1–54 (1994)Google Scholar
- 3.B. Chazelle, L. Guibas, and D. T. Lee. The Power of Duality. In: Proceedings of the 24th IEEE Annual Symposium on Foundations of Computer Science, 1983, pp. 217–225.Google Scholar
- 4.R. Cole, C. K. Yap. Geometric Retrieval Problems. Information and Control 63, 39–57 (1984)Google Scholar
- 5.J.R. Driscoll, N. Sarnak, D.D. Sleator, and R.E. Tarjan. Making data structures persistent. Journal of Computer and System Sciences 38, 86–124 (1989)Google Scholar
- 6.P. Gupta, R. Janardan, and M. Smid. Further results on generalized intersection searching problems: counting, reporting, and dynamization. In: Proceedings of the 1993 Workshop on Algorithms and Data Structures. August 1993, pp. 361–372.Google Scholar
- 7.P. Gupta, R. Janardan, and M. Smid. Efficient Algorithms for Generalized Intersection Searching on Non-Iso-oriented Objects. In: Proceedings of the 10th ACM Symposium on Computational Geometry. 1994, pp. 369–377Google Scholar
- 8.L. Guibas, M. Overmars, and M. Sharir. Intersecting line segments, ray shooting and other applications of geometric partitioning techniques. In: Proceedings SWAT '88. Lecture Notes in Computer Science 318: Springer Verlag, Berlin: 1988, pp. 64–73Google Scholar
- 9.R. Janardan, M. Lopez. Generalized intersection searching problems. International Journal of Computational Geometry and Applications 3, 39–69 (1993)Google Scholar
- 10.D. Kirkpatrick. Optimal search in planar subdivisions. SIAM Journal on Computing 12, 1, 28–35 (1993)Google Scholar
- 11.M.S. Paterson, F.F. Yao. Point retrieval for polygons. Journal of Algorithms 7, 441–447(1986)Google Scholar
- 12.N. Sarnak, R. E. Tarjan. Planar point location using persistent search trees. Communications of the ACM 29,669–679(1986)Google Scholar
- 13.D. E. Willard, G. S. Lueker. Adding range restriction capability to dynamic data structures. Journal of the ACM 32, 597–617 (1985)Google Scholar