Dobkin, David, et al. “Probing Convex Polytopes.”10.1007/978-1-4613-8997-2_25__Autonomous Robot Vehicles, edited by Ingemar Cox and Gordon Wilfong, Springer, 1990, pp. 328–41, doi:10.1007/978-1-4613-8997-2_25.

Edelsbrunner, Herbert, and Diane Souvaine. “Computing Least Median of Squares Regression Lines and Guided Topological Sweep.”10.1080/01621459.1990.10475313__Journal of the American Statistical Association, vol. 85, no. 409, American Statistical Association, 1990, pp. 115–19, doi:10.1080/01621459.1990.10475313.

Clarkson, Kenneth, et al. “Combinatorial Complexity Bounds for Arrangements of Curves and Spheres.”10.1007/BF02187783__Discrete &; Computational Geometry, vol. 5, no. 1, Springer, 1990, pp. 99–160, doi:10.1007/BF02187783.

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.

Ino, Tadashi, et al. “Direct Projections from Ammon’s Horn to the Rostral Raphe Regions in the Brainstem of the Cat.”10.1016/0006-8993(89)91346-2__Brain Research, vol. 479, no. 1, Elsevier, 1989, pp. 157–61, doi:10.1016/0006-8993(89)91346-2.

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.

Barton, Nicholas H. “The Divergence of a Polygenic System under Stabilising Selection, Mutation and Drift.”10.1017/S0016672300028378__Genetical Research, vol. 54, no. 1, Cambridge University Press, 1989, pp. 59–78, doi:10.1017/S0016672300028378.

Edelsbrunner, Herbert, and Steven Skiena. “Probing Convex Polygons with X-Rays.”10.1137/0217054 __SIAM Journal on Computing, vol. 17, no. 5, SIAM, 1988, pp. 870–82, doi:10.1137/0217054 .

Edelsbrunner, Herbert, et al. “On the Lower Envelope of Bivariate Functions and Its Applications.”10.1109/SFCS.1987.44__28th Annual Symposium on Foundations of Computer Science , IEEE, 1987, pp. 27–37, doi:10.1109/SFCS.1987.44.

Barton, Nicholas H., and Shahin Rouhani. “The Frequency of Shifts between Alternative Equilibria.”10.1016/S0022-5193(87)80210-2__Journal of Theoretical Biology, vol. 125, no. 4, Elsevier, 1987, pp. 397–418, doi:10.1016/S0022-5193(87)80210-2.

Edelsbrunner, Herbert, et al. “Constructing Arrangements of Lines and Hyperplanes with Applications.”10.1137/0215024__SIAM Journal on Computing, vol. 15, no. 2, SIAM, 1986, pp. 341–63, doi:10.1137/0215024.

Edelsbrunner, Herbert, and Emo Welzl. “On the Maximal Number of Edges of Many Faces in an Arrangement.”10.1016/0097-3165(86)90078-6__Journal of Combinatorial Theory Series A, vol. 41, no. 2, Elsevier, 1986, pp. 159–66, doi:10.1016/0097-3165(86)90078-6.

Szymura, Jacek, and Nicholas H. Barton. “Genetic Analysis of a Hybrid Zone between the Fire-Bellied Toads Bombina Bombina and B. Variegata, near Cracow in Southern Poland.”10.1111/j.1558-5646.1986.tb05740.x__Evolution; International Journal of Organic Evolution, vol. 40, Society for the Study of Evolution, 1986, pp. 1141–59, doi:10.1111/j.1558-5646.1986.tb05740.x.

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 Emo Welzl. “On the Number of Line Separations of a Finite Set in the Plane.”10.1016/0097-3165(85)90017-2__Journal of Combinatorial Theory Series A, vol. 38, no. 1, Elsevier, 1985, pp. 15–29, doi:10.1016/0097-3165(85)90017-2.

Edelsbrunner, Herbert. “Finding Transversals for Sets of Simple Geometric-Figures.”10.1016/0304-3975(85)90005-2__Theoretical Computer Science, vol. 35, no. 1, Elsevier, 1985, pp. 55–69, doi:10.1016/0304-3975(85)90005-2.

Day, William, and Herbert Edelsbrunner. “Investigation of Proportional Link Linkage Clustering Methods.”10.1007/BF01908077__Journal of Classification, vol. 2, no. 2–3, Springer, 1985, pp. 239–54, doi:10.1007/BF01908077.

Edelsbrunner, Herbert. “Computing the Extreme Distances between Two Convex Polygons.”10.1016/0196-6774(85)90039-2__Journal of Algorithms, vol. 6, no. 2, Academic Press, 1985, pp. 213–24, doi:10.1016/0196-6774(85)90039-2.

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, et al. “Some Methods of Computational Geometry Applied to Computer Graphics.”10.1016/0734-189X(84)90142-7__Computer Vision, Graphics, and Image Processing, vol. 28, no. 1, Elsevier, 1984, pp. 92–108, doi:10.1016/0734-189X(84)90142-7.

Barton, Nicholas H., et al. “Rare Electrophoretic Variants in a Hybrid Zone.”10.1038/hdy.1983.15__Heredity, vol. 50, no. 2, Nature Publishing Group, 1983, pp. 139–46, doi:10.1038/hdy.1983.15.

Edelsbrunner, Herbert. “A New Approach to Rectangle Intersections Part 2.”10.1080/00207168308803365__International Journal of Computer Mathematics, vol. 13, no. 3–4, Taylor &; Francis, 1983, pp. 221–29, doi:10.1080/00207168308803365.

Barton, Nicholas H., and Godfrey Hewitt. “A Measurement of Dispersal in the Grasshopper Podisma Pedestris (Orthoptera: Acrididae).”10.1038/hdy.1982.29__Heredity, vol. 48, no. 2, Springer Nature, 1982, pp. 237–49, doi:10.1038/hdy.1982.29.