An optimal algorithm for finding segments intersections

Proceedings of the Annual Symposium on Computational Geometry

Volumn Part F129372, Issue , 1995, Pages 211-219

  Balaban, Ivan J ^a  

^a KELDYSH INSTITUTE OF APPLIED MATHEMATICS   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTICALLY OPTIMAL; CURVE SEGMENTS; DETERMINISTIC ALGORITHMS; LINE SEGMENT; OPTIMAL ALGORITHM; TIME AND SPACE COMPLEXITY;

COMPUTATIONAL GEOMETRY;

EID: 85030245378     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/220279.220302     Document Type: Conference Paper

References (11)

1. Ben-Or, M. Lower bounds for algebraic computation trees. In Proceedings of the 15th Annual ACM Symposium Theory of Computing. (1983), 80-86.
2. Bentley, J. L., and Ottman, T. Algorithms for reporting and counting geometric intersections. IEEE Trans. Comput. C-28(1979), 643-647.
3. Chazelle, B. Filtering search: A new approach to query-answering. SIAM J. Comput. Vol. 15(1986), 703-725.
4. Chazelle, B. Reporting and counting segment intersections. J. Comput. Sys. Sci. 32(1986), s156-182.
5. Chazelle, B., and Edelsbrunner, H. An optimal algorithm for intersecting line segments in the plane. Journal of the ACM, Vol. 39(1992), 1-54.
6. Clarkson, K. L., and Shor, P. W. Applications of random sampling in computational geometry, II. Discrete and Computational Geometry, Vol. 4(1989), 387-421.
7. Edelsbrunner, EL, Guibas L. J., Stolfi J. Optimal point location in monotone subdivision. SIAM J. Comput. Vol. 15(2) (1986), 317-340.
8. Lueker, G. A data structure for orthogonal range queries. In Proceedings of the 19th annual IEEE Symposium on Foundations of Computer Scienee. (1979), 28-34.
9. Mulmuley, K. A fast planar partition algorithm. In Proceedings of the 29th annual IEEE Symposium on Foundations of Computer Science. (1988), 580-589.
10. Preparata, F. P., and Shamos, M. I. Computational geometry: An introduction. Springer-Verlag, New York, 1985.
11. Willard, D. Pohgon retrieval. SIAM J. Comput. Vol. 11(1982), 149-165.