Connected Component and Simple Polygon Intersection Searching

Algorithmica (New York)

Volumn 15, Issue 6, 1996, Pages 626-660

  Agarwal, P K ^a   Van Kreveld, M ^b  

^a Duke University   (United States)

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Arrangements; Data structures; Intersection searching; Partition trees

Indexed keywords

EID: 1542401272     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01940884     Document Type: Article

References (31)

1. P. K. Agarwal, Partitioning Arrangements of Lines: II. Applications, Discrete Comput. Geom. 5 (1991), 533-573.
2. P. K. Agarwal, Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number, SIAM J. Comput. 21 (1992), 540-570.
3. P. K. Agarwal, M. van Kreveld, and M. Overmars, Intersection Queries in Curved Objects, J. Algorithms 15 (1993), 229-266.
4. P. K. Agarwal and M. Sharir. Applications of a New Space Partitioning Technique, Discrete Comp. Geom. 9 (1993), 11-38.
5. B. Aronov, H. Edelsbrunner, L. Guibas, and M. Sharir, Improved Bounds on the Complexity of Many Faces in Arrangement of Segments, Combinatorica 12 (1992), 261-274.
6. R. Bar Yehuda and S. Fogel, Good Splitters with Applications to Ray Shooting, Algorithmica 11 (1994), 133-145.
7. B. Chazelle, M. Sharir, and E. Welzl, Quasi-Optimal Upper Bounds for Simplex Range Searching and New Zone Theorems, Algorithmica 8 (1992), 407-430.
8. S. W. Cheng and R. Janardan, Algorithms for Ray-Shooting and Intersection Searching, J. Algorithms 13 (1992), 670-692.
9. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, MIT Press, Cambridge, MA, 1990.
10. M. Dillencourt, H. Samet, and M. Tammiuen, A General Approach to Connected Component Labeling for Arbitrary Image Representation, J. Assoc. Comput. Mach. 39 (1992), 253-280.
11. D. P. Dobkin and H. Edelsbrunner, Space Searching for Intersecting Objects, J. Algorithms 8 (1987), 348-361.
12. H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, Berlin, 1987.
13. L. Guibas, Personal communication.
14. L. Guibas, M. Overmars, and M. Sharir, Ray Shooting, Implicit Point Location, and Related Queries in Arrangements of Segments, Techn. Rep. No. 433, New York University, 1989.
15. J. Gupta, R. Janardan, and M. Smid, Further Results on Generalized Intersection Searching Problems: Counting, Reporting and Dynamization, Proc. 3rd Workshop on Algorithms and Data Structures (1993), Lecture Notes in Computer Science, Vol. 709, Springer-Verlag, Berlin, pp. 361-372.
16. J. Gupta, R. Janardan, and M. Smid, Efficient Algorithms for Generalized Intersection Searching on Non-Iso-Oriented Objects, Proc. 10th ACM Symposium on Computational Geometry (1994), pp. 369-378.
17. J. Gupta, R. Janardan, and M. Smid, On Intersection Searching Involving Curved Objects, Proc. 4th Scand, Workshop on Algorithms Theory (1994), Lecture Notes in Computer Science, Vol. 824, Springer-Verlag, Berlin. pp. 183-194.
18. H. Imai and T. Asano, Finding the Connected Components and a Maximum Clique of an Intersection Graph of Rectangles in the Plane, J. Algorithms 4 (1984), 310-323.
19. R. Janardan and M. Lopez, Generalized Intersection Searching Problems, Internat. J. Comput. Geom. Appl. 3 (1993), 39-70.
20. J. Matoušek, Range Searching with Efficient Hierarchical Cuttings, Discrete Comput. Geom. 10 (1993), 157-182.
21. K. Mehlhorn, Data Structures and Algorithms 3: Multi-Dimensional Searching and Computational Geometry, Springer-Verlag, Berlin, 1984.
22. J. Nievergelt and P. Widmayer, Guard Files: Stabbing and Intersection Queries on Fat Spatial Objects, Comput. J. 36 (1993), 107-116.
23. M. H. Overmars, The Design of Dynamic Data Structures, Lecture Notes in Computer Science, Vol. 156, Springer-Verlag, Berlin, 1983.
24. M. H. Overmars, H. Schipper, and M. Sharir, Storing Line Segments in Partition Trees, BIT 30 (1990), 385-403.
25. F. P. Preparata, A Real Time Algorithm for Convex Hull. Comm. ACM 22 (1979), 402-405.
26. F. P. Preparata and M. I. Shamos, Computational Geometry - an Introduction, Springer-Verlag, New York, 1985.
27. N. Sarnak and R. Tarjan, Planar Point Location Using Persistent Search Trees, Comm. ACM 29 (1986), 609-679.
28. H. W. Scholten and M. H. Overmars, General Methods for Adding Range Restrictions to Decomposable Searching Problems, J. Symbolic Comput. 7 (1989), 1-10.
29. M. Sharir and P. Agarwal, Davenport-Schinzel Sequences and Their Geometric Applications, Cambridge University Press, New York, 1995.
30. R. E. Tarjan, Amortized Time Complexity, SIAM J. Discrete Math. 6 (1985), 306-318.
31. D. E. Willard and G. S. Lueker, Adding Range Restriction Capability to Dynamic Data Structures, J. Assoc. Comput. Mach. 32 (1985), 597-617.