Barton NH. Pleiotropic models of quantitative variation. Genetics. 1990;124(3):773-782. doi:10.1093/genetics/124.3.773 

Edelsbrunner H, Sharir M. A hyperplane Incidence problem with applications to counting distances. In: Proceedings of the International Symposium on Algorithms. Vol 450. Springer; 1990:419-428. doi:10.1007/3-540-52921-7_91

Edelsbrunner H, Guibas L, Sharir M. The complexity of many cells in arrangements of planes and related problems. Discrete &; Computational Geometry. 1990;5(1):197-216. doi:10.1007/BF02187785

Edelsbrunner H, Guibas L, Sharir M. The complexity and construction of many faces in arrangements of lines and of segments. Discrete &; Computational Geometry. 1990;5(1):161-196. doi:10.1007/BF02187784

Edelsbrunner H, Robison A, Shen X. Covering convex sets with non-overlapping polygons. Discrete Mathematics. 1990;81(2):153-164. doi:10.1016/0012-365X(90)90147-A

Clarkson K, Edelsbrunner H, Guibas L, Sharir M, Welzl E. Combinatorial complexity bounds for arrangements of curves and spheres. Discrete &; Computational Geometry. 1990;5(1):99-160. doi:10.1007/BF02187783

Agarwal P, Edelsbrunner H, Schwarzkopf O, Welzl E.10.1145/98524.98567__Euclidean minimum spanning trees and bichromatic closest pairs. In: Proceedings of the 6th Annual Symposium on Computational Geometry. ACM; 1990:203-210. doi:10.1145/98524.98567

Aronov B, Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Wenger R. Points and triangles in the plane and halving planes in space. In: Proceedings of the 6th Annual Symposium on Computational Geometry. ACM; 1990:112-115. doi:10.1145/98524.98548

Dobkin D, Edelsbrunner H, Overmars M. Searching for empty convex polygons. Algorithmica. 1990;5(4):561-571. doi:10.1007/BF01840404

Barton NH, Clark A. Population structure and processes in evolution. In: Wöhrmann K, Jain S, eds. Population Biology: Ecological and Evolutionary Viewpoints. Springer; 1990:115-174. doi:10.1007/978-3-642-74474-7_5

Edelsbrunner H, Guibas L, Hershberger J, et al. Implicitly representing arrangements of lines or segments. Discrete &; Computational Geometry. 1989;4(1):433-466. doi:10.1007/BF02187742

Yao F, Dobkin D, Edelsbrunner H, Paterson M. Partitioning space for range queries. SIAM Journal on Computing. 1989;18(2):371-384. doi:10.1137/0218025

Edelsbrunner H, Rote G, Welzl E. Testing the necklace condition for shortest tours and optimal factors in the plane. Theoretical Computer Science. 1989;66(2):157-180. doi:10.1016/0304-3975(89)90133-3

Edelsbrunner H, Preparata F, West D. Tetrahedrizing point sets in three dimensions. In: 10.1007/3-540-51084-2_31__International Symposium on Symbolic and Algebraic Computation. Vol 358. Springer; 1989:315-331. doi:10.1007/3-540-51084-2_31

Edelsbrunner H, Guibas L, Pach J, Pollack R, Seidel R, Sharir M. Arrangements of curves in the plane - topology, combinatorics, and algorithms. In: 15th International Colloquium on Automata, Languages and Programming. Vol 317. Springer; 1988:214-229. doi:10.1007/3-540-19488-6_118

Edelsbrunner H. Geometric structures in computational geometry. In: 15th International Colloquium on Automata, Languages and Programming. Vol 317. Springer; 1988:201-213. doi:10.1007/3-540-19488-6_117

Chazelle B, Edelsbrunner H. Linear space data structures for two types of range search. Discrete &; Computational Geometry. 1987;2(1):113-126. doi:10.1007/BF02187875

Edelsbrunner H. Algorithms in Combinatorial Geometry. Vol 10. Berlinf; Heidelberg: Springer; 1987. doi:10.1007/978-3-642-61568-9

Edelsbrunner H. Edge-skeletons in arrangements with applications. Algorithmica. 1986;1(1-4):93-109. doi:10.1007/BF01840438

Edelsbrunner H, Stöckl G. The number of extreme pairs of finite point-sets in Euclidean spaces. Journal of Combinatorial Theory Series A. 1986;43(2):344-349. doi:10.1016/0097-3165(86)90075-0