Edelsbrunner, Herbert, and Roman Waupotitsch. “Computing a Ham-Sandwich Cut in Two Dimensions.”10.1016/S0747-7171(86)80020-7__Journal of Symbolic Computation, vol. 2, no. 2, Elsevier, 1986, pp. 171–78, doi:10.1016/S0747-7171(86)80020-7.

Edelsbrunner, Herbert, et al. “Rectangular Point Location in D-Dimensions with Applications.”10.1093/comjnl/29.1.76__Computer Journal, vol. 29, no. 1, Oxford University Press, 1986, pp. 76–82, doi:10.1093/comjnl/29.1.76.

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.

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.

Edelsbrunner, Herbert, et al. “Graphics in Flatland: A Case Study.” Computational Geometry: Theory and Applications, edited by Franco Preparata, vol. 1, Elsevier, 1983, pp. 35–59.

Bucher, W., and Herbert Edelsbrunner. “On Expected- and Worst-Case Segment Trees.” Computational Geometry: Theory and Applications, edited by Franco Preparata, vol. 1, Elsevier, 1983, pp. 109–25.

Barton, Nicholas H., and Godfrey Hewitt. “Hybrid Zones as Barriers to Gene Flow.” Protein Polymorphism: Adaptive and Taxonomic Significance, edited by Geoffrey Oxford and David Rollinson, vol. 24, Academic Press, 1983, pp. 341–59.

Edelsbrunner, Herbert, and Mark Overmars. “On the Equivalence of Some Rectangle Problems.”10.1016/0020-0190(82)90068-0__Information Processing Letters, vol. 14, no. 3, Elsevier, 1982, pp. 124–27, doi:10.1016/0020-0190(82)90068-0.