Topological sweeping in three dimensions

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

Volumn 450 LNCS, Issue , 1990, Pages 310-317

  Anagnostou, Efthymios G ^a   Guibas, Leonidas J ^b   Polimenis, Vassilios G ^c  

^a UNIVERSITY OF TORONTO   (Canada)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84949193801     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-52921-7_80     Document Type: Conference Paper

References (4)

1. J. Bentley, T. Ottmann, “Algorithms for reporting and counting geometric intersections”, IEEE Trans. Comput., C 28(1979), pp. 643-647.
2. H. Edelsbrunner, L. Guibas, “Topologically sweeping an arrangement”, Proc. 18th ACM Symp. on Theory of Computing, 1986, pp. 389-403.
3. H. Edelsbrunner, J. O’Rourke, R. Seidel, “Constructing arrangements of lines and hyperplanes with applications”, SIAM J. Comput., 15 (1988), pp. 341-363.
4. H. Mairson, J. Stolfi, “Reporting and counting intersections between two sets of line segments”, Proceedings of the 1987 NATO Conference on Theoretical Foundations of Graphics and Computer Aided Design, Springer-Verlag.