A hyperplane Incidence problem with applications to counting distances
H. Edelsbrunner, M. Sharir, in:, Proceedings of the International Symposium on Algorithms, Springer, 1990, pp. 419–428.
LibreCat: https://research-explorer.ista.ac.at/record/4067
DOI: 10.1007/3-540-52921-7_91

The complexity of many cells in arrangements of planes and related problems
H. Edelsbrunner, L. Guibas, M. Sharir, Discrete &; Computational Geometry 5 (1990) 197–216.
LibreCat: https://research-explorer.ista.ac.at/record/4066
DOI: 10.1007/BF02187785

The complexity and construction of many faces in arrangements of lines and of segments
H. Edelsbrunner, L. Guibas, M. Sharir, Discrete &; Computational Geometry 5 (1990) 161–196.
LibreCat: https://research-explorer.ista.ac.at/record/4072
DOI: 10.1007/BF02187784

Counting and cutting cycles of lines and rods in space
B. Chazelle, H. Edelsbrunner, L. Guibas, R. Pollack, R. Seidel, M. Sharir, J. Snoeyink, in:, 31st Annual Symposium on Foundations of Computer Science, IEEE, 1990, pp. 242–251.
LibreCat: https://research-explorer.ista.ac.at/record/4073
DOI: 10.1109/FSCS.1990.89543

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

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

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

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

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

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

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

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

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

Covering convex sets with non-overlapping polygons
H. Edelsbrunner, A. Robison, X. Shen, Discrete Mathematics 81 (1990) 153–164.
LibreCat: https://research-explorer.ista.ac.at/record/4065
DOI: 10.1016/0012-365X(90)90147-A

Combinatorial complexity bounds for arrangements of curves and spheres
K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, E. Welzl, Discrete &; Computational Geometry 5 (1990) 99–160.
LibreCat: https://research-explorer.ista.ac.at/record/4074
DOI: 10.1007/BF02187783

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

 Euclidean minimum spanning trees and bichromatic closest pairs
P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, E. Welzl, in:, Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 203–210.
LibreCat: https://research-explorer.ista.ac.at/record/4076
DOI: 10.1145/98524.98567

Points and triangles in the plane and halving planes in space
B. Aronov, B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, R. Wenger, in:, Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 112–115.
LibreCat: https://research-explorer.ista.ac.at/record/4077
DOI: 10.1145/98524.98548

Searching for empty convex polygons
D. Dobkin, H. Edelsbrunner, M. Overmars, Algorithmica 5 (1990) 561–571.
LibreCat: https://research-explorer.ista.ac.at/record/4075
DOI: 10.1007/BF01840404

Population structure and processes in evolution
N.H. Barton, A. Clark, in:, K. Wöhrmann, S. Jain (Eds.), Population Biology: Ecological and Evolutionary Viewpoints, Springer, 1990, pp. 115–174.
LibreCat: https://research-explorer.ista.ac.at/record/4311
DOI: 10.1007/978-3-642-74474-7_5