Red-blue intersection reporting for objects of non-constant size

Computer Journal

Volumn 39, Issue 6, 1996, Pages

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

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PROBLEM SOLVING; QUERY LANGUAGES; SENSITIVITY ANALYSIS;

NONCONSTANT SIZED OBJECTS; RED BLUE INTERSECTION REPORTING;

OBJECT ORIENTED PROGRAMMING;

EID: 0030406494     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/39.6.541     Document Type: Article

References (16)

1. Agarwal, P. K. and Sharir, M. (1990) Red-blue intersection detection algorithms with applications to motion planning and collision detection. SIAM J. Comput., 19, 297-321.
2. Chazelle, B., Edelsbrunner, H., Guibas, L. J. and Sharir, M. (1994) Algorithms for bichromatic line-segment problems and polyhedral terrains. Algorithmica, 11, 116-132.
3. Mairson, H. and Stolfi, J. (1988) Reporting and counting intersections between two sets of line segments. In Earnshaw, R. A. (ed), Theoretical Foundations of Computer Graphics and CAD. NATO Series, Vol F-40, Springer-Verlag, Berlin, pp. 307-325.
4. van Kreveld, M. (1992) New results on data structures in Computational Geometry. Ph.D. Thesis, Department of Computer Science, University of Utrecht, Utrecht, Netherlands.
5. Janardan R. and Lopez, M. (1993) Generalized intersection searching problems. Internat. J. Comput. Geom. Appl., 3, 39-69.
6. Gupta, P., Janardan, R. and Smid, M. (1993) Further results on generalized intersection searching problems: counting, reporting and dynamization. Proceedings of the 1993 Workshop on Algorithms and Data Structures, Montreal, Canada, pp. 361-372. J. Algorithms, 19, 282-317 (1995).
7. Gupta, P., Janardan, R. and Smid, M. (1993) Further results on generalized intersection searching problems: counting, reporting and dynamization. Proceedings of the 1993 Workshop on Algorithms and Data Structures, Montreal, Canada, pp. 361-372. J. Algorithms, 19, 282-317 (1995).
8. Gupta, P., Janardan, R. and Smid, M. (1994) Efficient algorithms for generalized intersection searching on non-iso-oriented Objects. Proceedings of the 10th ACM Symposium on Computational Geometry, pp. 369-377. Comput Geom. Theory Appl., 6, 1-19 (1996).
9. Gupta, P., Janardan, R. and Smid, M. (1994) Efficient algorithms for generalized intersection searching on non-iso-oriented Objects. Proceedings of the 10th ACM Symposium on Computational Geometry, pp. 369-377. Comput Geom. Theory Appl., 6, 1-19 (1996).
10. Bozanis, P., Kitsios, N., Makris, C. and Tsakalidis, A. (1995) New upper bounds for generalized intersection searching problems. Proceedings of the 22nd International Colloquium Automata Languages and Programming, Szeged, Hungary, pp. 464-474.
11. Shamos, M. I. and Hoey, D. J. (1976) Geometric intersection problems. Proceedings of the 17th IEEE Symposium on Foundations of Computer Science, Houston, TX, pp. 208-215.
12. Bentley, J. and Ottmann, T. (1979) Algorithms for reporting and counting intersections. IEEE Trans. Comput., 28, 643-647.
13. Agarwal, P. K. and Sharir, M. (1991) Applications of a new space partitioning scheme. Proceedings of the 2nd Workshop on Algorithms and Data Structures, Ottawa, Canada, pp. 379-391.
14. Bistiolas, V., Sofotassios, D. and Tsakalidis, A. (1993) Computing rectangle enclosures. Comput. Geom. Theory Appl., 2, 303-308.
15. Matoušek, J. (1992) Range searching with efficient hierarchical cuttings. Proceedings of the 8th Annual Symposium on Computational Geometry, Berlin, Germany, pp. 276-285.
16. Matoušek, J. (1992) Efficient partition trees. Discrete Comput. Geom., 8, 315-334.