New Results on Intersection Query Problems

Computer Journal

Volumn 40, Issue 1, 1997, Pages

  Bozanis, Panayiotis ^c   Kitsios, Nectarios ^c   Makris, Christos ^a   Tsakalidis, Athanasios ^b  

^a UNIVERSITY OF PATRAS   (Greece)

^b University of Patras and Computer Technology Institute   (Greece)

^c NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 3743086216     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/40.1.22     Document Type: Article

References (25)

1. Agarwal, P. K. and van Kreveld, M. (1996) Connected component and simple polygon intersection searching. Algorithmica, 15, 626-660.
2. Bozanis, P., Kitsios, N., Makris, C. and Tsakalidis, A. (1995) New upper bounds for generalized intersection searching problems. Proc. 22nd Intl Colloquium Automata, Languages Programming, Szeged, Hungary, pp. 464-475.
3. Bozanis, P., Kitsios, N., Makris, C. and Tsakalidis, A. (1996) Red-blue intersection reporting for objects of non-constant size. Comput. J., 39, 541-547.
4. Gupta, P., Janardan, R. and Smid, M. (1995) Further results on generalized intersection searching problems: Counting, reporting, and dynamization. J. Algorithms, 19, 282-317.
5. Gupta, P., Janardan, R. and Smid, M. (1996) Efficient algorithms for generalized intersection searching on non-iso-oriented objects. Comput. Geom. Theory Appl., 6, 1-19.
6. Janardan, R. and Lopez, M. (1993) Generalized intersection searching problems. Intl J. Comput. Geom. Appl., 3, 39-69.
7. van Kreveld, M. (1992) New results on data structures in Computational Geometry. Ph.D. Thesis, Department of Computer Science, University of Utrecht, Utrecht.
8. Bistiolas, V., Sofotassios, D. and Tsakalidis, A. (1993) Computing rectangle enclosures. Comput. Geom. Theory Appl., 2, 303-308.
9. Driscoll, J. R., Sarnak, N., Sleator, D. D. and Tarjan, R. E. (1989) Making data structures persistent. J. Comput. Syst. Sci., 38, 86-124.
10. Gabow, H., Bentley, J. and Tarjan, R. (1984) Scaling and related techniques for geometry problems. Proc. 16th Annual ACM Symp. Theory Comput., Washington, DC, pp. 135-143.
11. Chazelle, B. (1988). A functional approach to data structures and its use in multidimensional searching. SIAM J. Comput., 17, 427-462.
12. Chazelle, B. and Guibas, L. J. (1986) Fractional cascading: II. Applications. Algorithmica, 1, 162-192.
13. Overmars, M. (1987) Efficient data structures for range searching on a grid. Technical Report RUU-CS-87-2, Department of Computer Science, University of Utrecht, Utrecht.
14. Subramanian, S. and Ramaswamy, S. (1995) The P-range tree: A new data structure for range searching in secondary memory. Proc. 6th ACM-SIAM Symp. Discrete Algorithms, San Francisco, CA, pp. 378-387.
15. Tan, H.-X., Hirata, T. and Inagaki, Y. (1991) The intersection searching problem for c-oriented polygons. Inf. Proc. Lett., 37, 201-204.
16. de Berg, M., Carlsson, S. and Overmars, M. (1992) A general approach to dominance in the plane. J. Algorithms, 1, 274-296.
17. Munro, J., Overmars, M. and Wood D. (1987) Variations on visibility. Proc. 3th ACM Symp. Computat. Geometry, Waterloo, Ontario, pp. 291-299.
18. Overmars, M. and Wood, D. (1988) On rectangular visibility. J. Algorithms, 9, 272-290.
19. Fries, O., Mehlhom, K., Näher, S. and Tsakalidis, A. (1987) A log log n data structure for three-sided range queries. Inf. Proc. Lett., 25, 269-273.
20. Vaishnavi, V. K. (1982) Computing point enclosures. IEEE Trans. Comput., 31, 22-29.
21. Edelsbrunner, H. and Overmars, M. H. (1982) On the equivalence of some rectangle problems. Inf. Proc. Lett., 14, 124-127.
22. Edelsbrunner, H. (1981). A note on dynamic range searching. Bulletin of the EATCS, 13 34-40.
23. Edelsbrunner, H., Maurer, H. A. and Kirkpatrick, D. G. (1982) Polygonal intersection searching. Inf. Proc. Lett., 14, 74-79.
24. Güting, R. H. (1984) Dynamic c-oriented polygonal intersection searching. Inform. Control, 63, 143-163.
25. Chazelle, B. and Guibas, L. J., (1986) Fractional cascading: I. A data structuring technique. Algorithmica, 1, 133-162.