Edelsbrunner H, Sharir M. A hyperplane incidence problem with applications to counting distances. In: Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift. Vol 4. American Mathematical Society; 1991:253-263.
LibreCat: https://research-explorer.ista.ac.at/record/3566

Edelsbrunner H, Hajnal P. A lower bound on the number of unit distances between the vertices of a convex polygon. Journal of Combinatorial Theory Series A. 1991;56(2):312-316. doi:10.1016/0097-3165(91)90042-F
LibreCat: https://research-explorer.ista.ac.at/record/4056
DOI: 10.1016/0097-3165(91)90042-F

Edelsbrunner H, Seidel R, Sharir M. On the zone theorem for hyperplane arrangements. In: Vol 555. Springer; 1991:108-123. doi:10.1007/BFb0038185
LibreCat: https://research-explorer.ista.ac.at/record/4054
DOI: 10.1007/BFb0038185

Chazelle B, Edelsbrunner H, Grigni M, et al. Ray shooting in polygons using geodesic triangulations. In: 18th International Colloquium on Automata, Languages and Programming. Vol 510. Springer; 1991:661-673. doi:10.1007/3-540-54233-7_172
LibreCat: https://research-explorer.ista.ac.at/record/4059
DOI: 10.1007/3-540-54233-7_172

Agarwal P, Edelsbrunner H, Schwarzkopf O, Welzl E. Euclidean minimum spanning trees and bichromatic closest pairs. Discrete &; Computational Geometry. 1991;6(1):407-422. doi:10.1007/BF02574698
LibreCat: https://research-explorer.ista.ac.at/record/4061
DOI: 10.1007/BF02574698

Barton NH. Pleiotropic models of quantitative variation. Genetics. 1990;124(3):773-782. doi:10.1093/genetics/124.3.773 
LibreCat: https://research-explorer.ista.ac.at/record/3651
DOI: 10.1093/genetics/124.3.773 
PMID: 2311921

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
LibreCat: https://research-explorer.ista.ac.at/record/4067
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
LibreCat: https://research-explorer.ista.ac.at/record/4066
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
LibreCat: https://research-explorer.ista.ac.at/record/4072
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
LibreCat: https://research-explorer.ista.ac.at/record/4065
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
LibreCat: https://research-explorer.ista.ac.at/record/4074
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
LibreCat: https://research-explorer.ista.ac.at/record/4076
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
LibreCat: https://research-explorer.ista.ac.at/record/4077
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
LibreCat: https://research-explorer.ista.ac.at/record/4075
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
LibreCat: https://research-explorer.ista.ac.at/record/4311
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
LibreCat: https://research-explorer.ista.ac.at/record/4088
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
LibreCat: https://research-explorer.ista.ac.at/record/4083
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
LibreCat: https://research-explorer.ista.ac.at/record/4084
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
LibreCat: https://research-explorer.ista.ac.at/record/4087
DOI: 10.1007/3-540-51084-2_31

Mizuno N, Ueyama T, Itoh K, Satoda T, Tashiro T, Shigemoto R. Direct projections from the subthalamic nucleus of Luys to the spinal cord in the Japanese monkey. Neuroscience Letters. 1988;89(1):13-18. doi:10.1016/0304-3940(88)90473-9
LibreCat: https://research-explorer.ista.ac.at/record/2523
DOI: 10.1016/0304-3940(88)90473-9
PMID: 2456494