Edelsbrunner, Herbert, and Péter Hajnal. “A Lower Bound on the Number of Unit Distances between the Vertices of a Convex Polygon.”https://doi.org/10.1016/0097-3165(91)90042-F__Journal of Combinatorial Theory Series A. Elsevier, 1991.https://doi.org/10.1016/0097-3165(91)90042-F .

Edelsbrunner, Herbert, Raimund Seidel, and Micha Sharir. “On the Zone Theorem for Hyperplane Arrangements,”https://doi.org/10.1007/BFb0038185__555:108–23. Springer, 1991.https://doi.org/10.1007/BFb0038185 .

Chazelle, Bernard, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas Guibas, John Hershberger, Micha Sharir, and Jack Snoeyink. “Ray Shooting in Polygons Using Geodesic Triangulations.”https://doi.org/10.1007/3-540-54233-7_172__In 18th International Colloquium on Automata, Languages and Programming, 510:661–73. Springer, 1991.https://doi.org/10.1007/3-540-54233-7_172 .

Agarwal, Pankaj, Herbert Edelsbrunner, Otfried Schwarzkopf, and Emo Welzl. “Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.”https://doi.org/10.1007/BF02574698__Discrete &; Computational Geometry. Springer, 1991.https://doi.org/10.1007/BF02574698 .

Barton, Nicholas H. “Pleiotropic Models of Quantitative Variation.”https://doi.org/10.1093/genetics/124.3.773 __Genetics. Genetics Society of America, 1990.https://doi.org/10.1093/genetics/124.3.773  .

Edelsbrunner, Herbert, and Micha Sharir. “A Hyperplane Incidence Problem with Applications to Counting Distances.”https://doi.org/10.1007/3-540-52921-7_91__In Proceedings of the International Symposium on Algorithms, 450:419–28. Springer, 1990.https://doi.org/10.1007/3-540-52921-7_91 .

Edelsbrunner, Herbert, Leonidas Guibas, and Micha Sharir. “The Complexity of Many Cells in Arrangements of Planes and Related Problems.”https://doi.org/10.1007/BF02187785__Discrete &; Computational Geometry. Springer, 1990.https://doi.org/10.1007/BF02187785 .

Edelsbrunner, Herbert, Leonidas Guibas, and Micha Sharir. “The Complexity and Construction of Many Faces in Arrangements of Lines and of Segments.”https://doi.org/10.1007/BF02187784__Discrete &; Computational Geometry. Springer, 1990.https://doi.org/10.1007/BF02187784 .

Edelsbrunner, Herbert, Arch Robison, and Xiao Shen. “Covering Convex Sets with Non-Overlapping Polygons.”https://doi.org/10.1016/0012-365X(90)90147-A__Discrete Mathematics. Elsevier, 1990.https://doi.org/10.1016/0012-365X(90)90147-A .

Clarkson, Kenneth, Herbert Edelsbrunner, Leonidas Guibas, Micha Sharir, and Emo Welzl. “Combinatorial Complexity Bounds for Arrangements of Curves and Spheres.”https://doi.org/10.1007/BF02187783__Discrete &; Computational Geometry. Springer, 1990.https://doi.org/10.1007/BF02187783 .

Agarwal, Pankaj, Herbert Edelsbrunner, Otfried Schwarzkopf, and Emo Welzl. “Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.”https://doi.org/10.1145/98524.98567__In Proceedings of the 6th Annual Symposium on Computational Geometry, 203–10. ACM, 1990.https://doi.org/10.1145/98524.98567 .

Aronov, Boris, Bernard Chazelle, Herbert Edelsbrunner, Leonidas Guibas, Micha Sharir, and Rephael Wenger. “Points and Triangles in the Plane and Halving Planes in Space.”https://doi.org/10.1145/98524.98548__In Proceedings of the 6th Annual Symposium on Computational Geometry, 112–15. ACM, 1990.https://doi.org/10.1145/98524.98548 .

Dobkin, David, Herbert Edelsbrunner, and Mark Overmars. “Searching for Empty Convex Polygons.”https://doi.org/10.1007/BF01840404__Algorithmica. Springer, 1990.https://doi.org/10.1007/BF01840404 .

Barton, Nicholas H, and A. Clark. “Population Structure and Processes in Evolution.”https://doi.org/10.1007/978-3-642-74474-7_5__In Population Biology: Ecological and Evolutionary Viewpoints, edited by Klaus Wöhrmann and Subodh Jain, 115–74. Springer, 1990.https://doi.org/10.1007/978-3-642-74474-7_5 .

Edelsbrunner, Herbert, Leonidas Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, and Emo Welzl. “Implicitly Representing Arrangements of Lines or Segments.”https://doi.org/10.1007/BF02187742__Discrete &; Computational Geometry. Springer, 1989.https://doi.org/10.1007/BF02187742 .

Yao, F., David Dobkin, Herbert Edelsbrunner, and Michael Paterson. “Partitioning Space for Range Queries.”https://doi.org/10.1137/0218025__SIAM Journal on Computing. SIAM, 1989.https://doi.org/10.1137/0218025 .

Edelsbrunner, Herbert, Günter Rote, and Emo Welzl. “Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane.”https://doi.org/10.1016/0304-3975(89)90133-3__Theoretical Computer Science. Elsevier, 1989.https://doi.org/10.1016/0304-3975(89)90133-3 .

Edelsbrunner, Herbert, Franco Preparata, and Douglas West. “Tetrahedrizing Point Sets in Three Dimensions.”https://doi.org/10.1007/3-540-51084-2_31__In https://doi.org/10.1007/3-540-51084-2_31__International Symposium on Symbolic and Algebraic Computation, 358:315–31. Springer, 1989.https://doi.org/10.1007/3-540-51084-2_31 .

Edelsbrunner, Herbert, Leonidas Guibas, János Pach, Richard Pollack, Raimund Seidel, and Micha Sharir. “Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms.”https://doi.org/10.1007/3-540-19488-6_118__In 15th International Colloquium on Automata, Languages and Programming, 317:214–29. Springer, 1988.https://doi.org/10.1007/3-540-19488-6_118 .

Edelsbrunner, Herbert. “Geometric Structures in Computational Geometry.”https://doi.org/10.1007/3-540-19488-6_117__In 15th International Colloquium on Automata, Languages and Programming, 317:201–13. Springer, 1988.https://doi.org/10.1007/3-540-19488-6_117 .