Agarwal, Pankaj, et al. “Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.”10.1145/98524.98567__Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 203–10, doi:10.1145/98524.98567.

Aronov, Boris, et al. “Points and Triangles in the Plane and Halving Planes in Space.”10.1145/98524.98548__Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 112–15, doi:10.1145/98524.98548.

Dobkin, David, et al. “Searching for Empty Convex Polygons.”10.1007/BF01840404__Algorithmica, vol. 5, no. 4, Springer, 1990, pp. 561–71, doi:10.1007/BF01840404.

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

Edelsbrunner, Herbert, et al. “Implicitly Representing Arrangements of Lines or Segments.”10.1007/BF02187742__Discrete &; Computational Geometry, vol. 4, no. 1, Springer, 1989, pp. 433–66, doi:10.1007/BF02187742.

Yao, F., et al. “Partitioning Space for Range Queries.”10.1137/0218025__SIAM Journal on Computing, vol. 18, no. 2, SIAM, 1989, pp. 371–84, doi:10.1137/0218025.

Edelsbrunner, Herbert, et al. “Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane.”10.1016/0304-3975(89)90133-3__Theoretical Computer Science, vol. 66, no. 2, Elsevier, 1989, pp. 157–80, doi:10.1016/0304-3975(89)90133-3.

Edelsbrunner, Herbert, et al. “Tetrahedrizing Point Sets in Three Dimensions.”10.1007/3-540-51084-2_31__10.1007/3-540-51084-2_31__International Symposium on Symbolic and Algebraic Computation, vol. 358, Springer, 1989, pp. 315–31, doi:10.1007/3-540-51084-2_31.

Edelsbrunner, Herbert, et al. “Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms.”10.1007/3-540-19488-6_118__15th International Colloquium on Automata, Languages and Programming, vol. 317, Springer, 1988, pp. 214–29, doi:10.1007/3-540-19488-6_118.

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

Chazelle, Bernard, and Herbert Edelsbrunner. “Linear Space Data Structures for Two Types of Range Search.”10.1007/BF02187875__Discrete &; Computational Geometry, vol. 2, no. 1, Springer, 1987, pp. 113–26, doi:10.1007/BF02187875.

Edelsbrunner, Herbert. Algorithms in Combinatorial Geometry. Vol. 10, Springer, 1987, doi:10.1007/978-3-642-61568-9.

Edelsbrunner, Herbert. “Edge-Skeletons in Arrangements with Applications.”10.1007/BF01840438__Algorithmica, vol. 1, no. 1–4, Springer, 1986, pp. 93–109, doi:10.1007/BF01840438.

Edelsbrunner, Herbert, and Gerd Stöckl. “The Number of Extreme Pairs of Finite Point-Sets in Euclidean Spaces.”10.1016/0097-3165(86)90075-0__Journal of Combinatorial Theory Series A, vol. 43, no. 2, Elsevier, 1986, pp. 344–49, doi:10.1016/0097-3165(86)90075-0.

Edelsbrunner, Herbert, and David Haussler. “The Complexity of Cells in 3-Dimensional Arrangements.”10.1016/0012-365X(86)90008-7__Discrete Mathematics, vol. 60, no. C, Elsevier, 1986, pp. 139–46, doi:10.1016/0012-365X(86)90008-7.

Edelsbrunner, Herbert, and Hermann Maurer. “Finding Extreme-Points in 3-Dimensions and Solving the Post-Office Problem in the Plane.”10.1016/0020-0190(85)90107-3__Information Processing Letters, vol. 21, no. 1, Elsevier, 1985, pp. 39–47, doi:10.1016/0020-0190(85)90107-3.

Day, William, and Herbert Edelsbrunner. “Efficient Algorithms for Agglomerative Hierarchical Clustering Methods.”10.1007/BF01890115__Journal of Classification, vol. 1, Springer, 1984, pp. 7–24, doi:10.1007/BF01890115.

Edelsbrunner, Herbert. “Key-Problems and Key-Methods in Computational Geometry.”10.1007/3-540-12920-0_1__1st Symposium of Theoretical Aspects of Computer Science, vol. 166, Springer, 1984, pp. 1–13, doi:10.1007/3-540-12920-0_1.

Dobkin, David, and Herbert Edelsbrunner. “Ham-Sandwich Theorems Applied to Intersection Problems.” 9th International Workshop on Graph Theoretic Concepts in Computer Science, Teubner, 1984, pp. 88–99.

Edelsbrunner, Herbert, and Emo Welzl. “Monotone Edge Sequences in Line Arrangements and Applications.”10.1007/BFb0030307__11th International Symposium on Mathematical Foundations of Computer Science, vol. 176, Springer, 1984, pp. 265–72, doi:10.1007/BFb0030307.