An Optimal Algorithm for Intersecting Line Segments in the Plane

Journal of the ACM (JACM)

Volumn 39, Issue 1, 1992, Pages 1-54

  Chazelle, Bernard ^a   Edelsbrunner, Herbert ^b  

^a PRINCETON UNIVERSITY   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; NUMERICAL ANALYSIS;

TIME COMPLEXITY;

ALGORITHMS;

EID: 0026460645     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/147508.147511     Document Type: Article

References (24)

1. BAUMGART, B. G. A polyhedron representation for computer vision. In Proceedings of the 1975 National Computer Conference. AFIPS Conference Proceedings, vol. 44. AFIPS Press, Reston, Va., 1975, pp. 589-596.
2. BEN-OR, M. Lower bounds for algebraic computation trees. In Proceedings of the 15th Annual ACM Symposium Theory of Computing (Boston, Mass., Apr. 25-27). APS, New York, 1983, pp. 80-86.
3. BENTLEY, J. L., AND OTTMANN, T. Algorithms for reporting and counting geometric intersections. IEEE Trans. Comput. C-28 (1979), 643-647.
4. BENTLEY, J. L., AND WOOD, D. An optimal worst-case algorithm for reporting intersections of rectangles. IEEE Trans. Comput. C-29 (1980), 571-577.
5. BROWN, K. Q. Comments on “Algorithms for reporting and counting geometric intersections.” IEEE Trans. Comput. C-30 (1981), 147-148.
6. CHAZELLE, B. Reporting and counting segment intersections. J. Comput. Sys. Sci. 32 (1986), 156-182.
7. CHAZELLE, B. A functional approach to data structures and its use in multidimensional searching. SIAM J. Comput. 17 (1988), 427-462.
8. CLARKSON, K. L. Applications of random sampling in computational geometry, II. In Proceedings of the 4th Annual ACM Symposium on Computational Geometry (Urbana-Champaign, Ill., June 6-8). ACM, New York, 1988, pp. 1-11.
9. DOBKIN, D. P., AND LIPTON, R. Multidimensional searching problems. SIAM J. Comput. 5 (1976), 181-186.
10. EDELSBRUNNER, H. Algorithms in Combinatorial Geometry. Springer-Verlag, Heidelberg. Germany, 1987.
11. EDELSBRUNNER, H., AND GUIBAS, L. J. Topologically sweeping an arrangement. In Proceedings of the 18th Annual ACM Symposium on the Theory of Computing (Berkeley, Calif., May 28-30). ACM, New York, 1986. pp. 389-403.
12. EDELSBRUNNER, H., AND MÜCKE, E. P. Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms. In Proceedings of the 4th Annual ACM Symposium on Computational Geometry (Urbana-Champaign, Ill., June 6-8). ACM, New York, 1988, pp. 118-133.
13. FREDMAN, M. On the information theoretic lower bound. Theoret. Comput. Sci. 1 (1976), 355-361.
14. GUIBAS. L. J., AND SEDGEWICK. R. A dichromatic framework for balanced trees. In Proceedings of the 19th Annual IEEE Symposium on Foundations of Computer Science, IEEE, New York, 1978, pp. 8-21.
15. GUIBAS, L. J., AND SEIDEL, R. Computing convolutions using reciprocal search. In Proceedings of the 2nd Annual ACM Symposium on Computational Geometry (Yorktown Heights, N.Y., June 2-4). ACM, New York, 1986, pp. 90-99.
16. GUIBAS, L J., AND STOLFI. J. Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams. ACM Trans. Graph. 4, 2 (Apr 1985), 76-123.
17. HOFFMAN, K., MEHLHORN, K., ROSENSTIEHL, P., AND TARJAN, R. Sorting Jordan sequences in linear time using level-linked search trees. Inf. Contr. 68 (1986), 170-184.
18. MAIRSON, H. G., AND STOLFI, J. Reporting and counting intersections between two sets of line segments. In Proceedings of the NATO Advanced Study, Institute on Theoretical Foundations of the Computational Graphics and CAD (Il Ciocco, Castelvecchio Pascoli, Italy). Springer-Verlag, New York, 1987.
19. MULMULEY, K. A fast planar partition algorithm, I. In Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, IEEE, New York, 1988, pp. 580-589.
20. NEWMAN, W. M, AND SPROULL, R. F. Principles of interactive computer graphics. McGraw-Hill, New York, 1973.
21. NIEVERGELT, J., AND PREPARATA, F. P. Plane-sweep algorithms for intersecting geometric figures. Commun. ACM 25, 10 (Oct. 1982). 739-747
22. PREPARATA, F. P., AND SHAMOS, M. I. Computational geometry-An introduction Springer-Verlag, New York, 1985.
23. SEDGEWICK, R. Algorithms. Addison-Wesley, New York, 1983.
24. TARJAN. R. E. Data structures and network algorithms SIAM, Philadelphia, Pa., 1983.