Chazelle, B., Edelsbrunner, H., Guibas, L., Pollack, R., Seidel, R., Sharir, M., &; Snoeyink, J. (1990). Counting and cutting cycles of lines and rods in space. In 31st Annual Symposium on Foundations of Computer Science (pp. 242–251). St. Louis, MO, United States of America: IEEE.https://doi.org/10.1109/FSCS.1990.89543 

Edelsbrunner, H., Overmars, M., Welzl, E., Hartman, I., &; Feldman, J. (1990). Ranking intervals under visibility constraints. International Journal of Computer Mathematics. Taylor &; Francis.https://doi.org/10.1080/00207169008803871 

Edelsbrunner, H., Tan, T., &; Waupotitsch, R. (1990). An O(n^2log n) time algorithm for the MinMax angle triangulation. In Proceedings of the 6th annual symposium on Computational geometry (pp. 44–52). Berkley, CA, United States: ACM.https://doi.org/10.1145/98524.98535 

Edelsbrunner, H., &; Sharir, M. (1990). The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n2. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/BF02187778 

Edelsbrunner, H. (1990). An acyclicity theorem for cell complexes in d dimension. Combinatorica. Springer.https://doi.org/10.1007/BF02122779