This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
J. Bentley, T. Ottmann, “Algorithms for reporting and counting geometric intersections”, IEEE Trans. Comput., C 28(1979), pp. 643–647.
H. Edelsbrunner, L. Guibas, “Topologically sweeping an arrangement”, Proc. 18th ACM Symp. on Theory of Comuting, 1986, pp. 389–403.
H. Edelsbrunner, J. O'Rourke, R. Seidel, “Constructing arrangements of lines and hyperplanes with applications”, SIAM J. Comput., 15 (1988), pp. 341–363.
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.
Author information
Authors and Affiliations
Editor information
Rights 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