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

Chazelle B, Edelsbrunner H, Guibas L, et al. Counting and cutting cycles of lines and rods in space. In: 31st Annual Symposium on Foundations of Computer Science. IEEE; 1990:242-251. doi:10.1109/FSCS.1990.89543
LibreCat: https://research-explorer.ista.ac.at/record/4073
DOI: 10.1109/FSCS.1990.89543

Edelsbrunner H, Overmars M, Welzl E, Hartman I, Feldman J. Ranking intervals under visibility constraints. International Journal of Computer Mathematics. 1990;34(3-4):129-144. doi:10.1080/00207169008803871
LibreCat: https://research-explorer.ista.ac.at/record/4070
DOI: 10.1080/00207169008803871

Edelsbrunner H, Tan T, Waupotitsch R. An O(n^2log n) time algorithm for the MinMax angle triangulation. In: Proceedings of the 6th Annual Symposium on Computational Geometry. ACM; 1990:44-52. doi:10.1145/98524.98535
LibreCat: https://research-explorer.ista.ac.at/record/4071
DOI: 10.1145/98524.98535

Edelsbrunner H, Sharir M. The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n2. Discrete &; Computational Geometry. 1990;5(1):35-42. doi:10.1007/BF02187778
LibreCat: https://research-explorer.ista.ac.at/record/4068
DOI: 10.1007/BF02187778

Edelsbrunner H. An acyclicity theorem for cell complexes in d dimension. Combinatorica. 1990;10(3):251-260. doi:10.1007/BF02122779
LibreCat: https://research-explorer.ista.ac.at/record/4069
DOI: 10.1007/BF02122779

Bräu M, Dreyer F, Jonas PM, Repp H, Vogel W. A K+ channel in Xenopus nerve fibres selectively blocked by bee and snake toxins: binding and voltage-clamp experiments. Journal of Physiology. 1990;420:365-385. doi:10.1113/jphysiol.1990.sp017918
LibreCat: https://research-explorer.ista.ac.at/record/3467
DOI: 10.1113/jphysiol.1990.sp017918
PMID: 2324990

Dobkin D, Edelsbrunner H, Yap C. Probing convex polytopes. In: Cox I, Wilfong G, eds. Autonomous Robot Vehicles. Springer; 1990:328-341. doi:10.1007/978-1-4613-8997-2_25
LibreCat: https://research-explorer.ista.ac.at/record/3565
DOI: 10.1007/978-1-4613-8997-2_25

Edelsbrunner H, Souvaine D. Computing least median of squares regression lines and guided topological sweep. Journal of the American Statistical Association. 1990;85(409):115-119. doi:10.1080/01621459.1990.10475313
LibreCat: https://research-explorer.ista.ac.at/record/4064
DOI: 10.1080/01621459.1990.10475313

Edelsbrunner H, Mücke E. Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms. ACM Transactions on Graphics. 1990;9(1):66-104. doi:10.1145/77635.77639
LibreCat: https://research-explorer.ista.ac.at/record/4063
DOI: 10.1145/77635.77639

Edelsbrunner H, Preparata F, West D. Tetrahedrizing point sets in three dimensions. Journal of Symbolic Computation. 1990;10(3-4):335-347. doi:10.1016/S0747-7171(08)80068-5
LibreCat: https://research-explorer.ista.ac.at/record/4060
DOI: 10.1016/S0747-7171(08)80068-5

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

Chazelle B, Edelsbrunner H, Guibas L, Hershberger J, Seidel R, Sharir M. Slimming down by adding; selecting heavily covered points. In: Proceedings of the 6th Annual Symposium on Computational Geometry. ACM; 1990:116-127. doi:10.1145/98524.98551
LibreCat: https://research-explorer.ista.ac.at/record/4078
DOI: 10.1145/98524.98551

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