Skip to main content

Topological sweeping in three dimensions

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 450))

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Bentley, T. Ottmann, “Algorithms for reporting and counting geometric intersections”, IEEE Trans. Comput., C 28(1979), pp. 643–647.

    Google Scholar 

  2. H. Edelsbrunner, L. Guibas, “Topologically sweeping an arrangement”, Proc. 18th ACM Symp. on Theory of Comuting, 1986, pp. 389–403.

    Google Scholar 

  3. H. Edelsbrunner, J. O'Rourke, R. Seidel, “Constructing arrangements of lines and hyperplanes with applications”, SIAM J. Comput., 15 (1988), pp. 341–363.

    Article  Google Scholar 

  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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Tetsuo Asano Toshihide Ibaraki Hiroshi Imai Takao Nishizeki

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Anagnostou, E.G., Guibas, L.J., Polimenis, V.G. (1990). Topological sweeping in three dimensions. In: Asano, T., Ibaraki, T., Imai, H., Nishizeki, T. (eds) Algorithms. SIGAL 1990. Lecture Notes in Computer Science, vol 450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52921-7_80

Download citation

  • DOI: https://doi.org/10.1007/3-540-52921-7_80

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52921-7

  • Online ISBN: 978-3-540-47177-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics