1. Algorithms in Combinatorial Geometry
2. Topologically sweeping an arrangement
3. Edelsbrunner, H., Guibas, L. J. and Sharir, M. “The Complexity of Many Faces in Arrangements of Lines and of Segments”. Proceedings of the Fourth Annual ACM Symposium on Computational Geometry. pp.44–55. New York: Association for Computing Machinery.
4. Edelsbrunner, H. and Mücke, E. P. “Simulation of Simplicity: A Technique to Cope With Degeneracies in Geometric Algorithms”. Proceedings of the Fourth Annual ACM Symposium on Computational Geometry. pp.118–133. New York: Association for Computing Machinery.
5. Constructing Belts in Two-Dimensional Arrangements with Applications