Reporting red-blue intersections between two sets of connected line segments

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1136, Issue , 1996, Pages 302-319

  Basch, Julien ^a   Guibas, Leonidas J ^a   Ramkumar, G D ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CONNECTED LINES; INVERSE ACKERMANN FUNCTION; LINE SEGMENT; PARTIAL INFORMATION; RUNNING TIME; SIMPLE POLYGON; SWEEP ALGORITHMS; VERTICAL ORDERING;

ALGORITHMS;

EID: 84958037099     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61680-2_64     Document Type: Conference Paper

References (28)

1. P. K. Agarwal. Partitioning arrangements of lines: II. Applications. Discrete Comput. Geom., 5:533-573, 1990.
2. P. K. Agarwal, M. de Berg, J. Matoušek, and O. Schwarzkopf. Constructing levels in arrangements and higher order Voronoi diagrams. In Proc. lOth Annu. ACM Sympos. Comput. Geom., pages 67-75, 1994.
3. P. K. Agarwal and M. Sharir. Red-blue intersection detection algorithms, with applications to motion planning and collision detection. In Proc. 4th Annu. ACM Sympos. Comput. Geom., pages 70-80, 1988.
4. C. Aragon and R. Seidel. Randomized search trees. In Proe. 30th Annu. IEEE Sympos. Found. Comput. Sci., pages 540-545, 1989.
5. J. Basch, L. J. Guibas, and J. Hershberger. Data structures for mobile data. In preparation.
6. J. Basch, L.J. Guibas, G.D. Ramkumar, and L. Ramshaw. Polyhedral tracings and their convolution. In Proc. 2nd Workshop on Algorithmic Fundations of Robotics, 1996.
7. J. L. Bentley and T. A. Ottmann. Algorithms for reporting and counting geometric intersections. IEEE Trans. Comput., C-28:643-647, 1979.
8. B. Chazelle. Filtering search: a new approach to query-answering. SIAM J. Comput., 15:703-724, 1986.
9. B. Chazelle and H. Edelsbrunner. An optimal algorithm for intersecting line segments in the plane, ft. ACM, 39:1-54, 1992.
10. B. Chazelle, H. Edelsbrunner, L. Guibas, and M. Sharir. Algorithms for bichromatic line segment problems and polyhedral terrains. Algorithmica, 11:116-132, 1994.
11. B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, and J. Snoeyink. Computing a face in an arrangement of line segments and related problems. SIAM J. Comput., 22:1286-1302, 1993.
12. K. L. Clarkson and P. W. Shot. Applications of random sampling in computational geometry, II. Discrete Comput. Geom., 4:387-421, 1989.
13. R. Cole, M. Sharir, and C. K. Yap. On k-hulls and related problems. SIAM J. Comput., 16:61-77, 1987.
14. M. de Berg. Personal communication. 1996.
15. M. de Berg and O. Schwarzkopf. Cuttings and applications. Report RUU-CS-92-26, Dept. Comput. Sci., Utrecht Univ., Utrecht, Netherlands, August 1992.
16. H. Edelsbrunner and L. J. Guibas. Topologically sweeping an arrangement. J. Comput. Syst. Sci., 38:165-194, 1989. Corrigendum in 42 (1991), 249-251.
17. H. Edelsbrunner and E. P. Miicke. Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms. ACM Trans. Graph., 9:66-104, 1990.
18. H. Edelsbrunner and E. Welzl. Constructing belts in two-dimensional arrangements with applications. SIAM J. Comput., 15:271-284, 1986.
19. J. Erickson. New lower bounds for Hopcroft's problem. In Proc. 11th Annu. ACM Sympos. Comput. Geom., pages 127-137, 1995.
20. L. Guibas, M. Overmars, and M. Sharir. Intersecting line segments, ray shooting, and other applications of geometric partitioning techniques. In Proc. 1st Scand. Workshop Algorithm Theory, volume 318 of Lecture Notes in Computer Science, pages 64-73. Springer-Verlag, 1988.
21. S. Hart and M. Sharir. Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes. Combinatorica, 6:151-177, 1986.
22. H. G. Mairson and J. Stolfi. Reporting and counting intersections between two sets of line segments. In R. A. Earnshaw, editor, Theoretical Foundations of Computer Graphics and CAD, volume F40 of NATO ASI, pages 307-325. Springer-Verlag, Berlin, West Germany, 1988.
23. J. Matoušek. Spanning trees with low crossing number. In]ormatique Thdorique et Applications, 25(2):103-123, 1991.
24. J. Matougek. Range searching with efficient hierarchical cuttings. Discrete Comput. Geom., 10(2):157-182, 1993.
25. K. Mulmuley. On levels in arrangements and Voronoi diagrams. Discrete Comput. Geom., 6:307-338, 1991.
26. M. H. Overmars and J. van Leeuwen. Maintenance of configurations in the plane. J. Comput. Syst. Sci., 23:166-204, 1981.
27. Larry Palazzi and Jack Snoeyink. Counting and reporting red/blue segment intersections. In Proc. 3rd Workshop Algorithms Data Struct., volume 709 of Lecture Notes in Computer Science, pages 530-540, 1993.
28. M. Sharir and P. K. Agarwal. Davenport-Sehinzel Sequences and Their Geometric Applications. Cambridge University Press, New York, 1995.