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

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

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

B. Chazelle et al., “Counting and cutting cycles of lines and rods in space,” in 31st Annual Symposium on Foundations of Computer Science, St. Louis, MO, United States of America, 1990, pp. 242–251.
LibreCat: https://research-explorer.ista.ac.at/record/4073
DOI: 10.1109/FSCS.1990.89543

H. Edelsbrunner, M. Overmars, E. Welzl, I. Hartman, and J. Feldman, “Ranking intervals under visibility constraints,” International Journal of Computer Mathematics, vol. 34, no. 3–4. Taylor &; Francis, pp. 129–144, 1990.
LibreCat: https://research-explorer.ista.ac.at/record/4070
DOI: 10.1080/00207169008803871

H. Edelsbrunner, T. Tan, and R. Waupotitsch, “An O(n^2log n) time algorithm for the MinMax angle triangulation,” in Proceedings of the 6th annual symposium on Computational geometry, Berkley, CA, United States, 1990, pp. 44–52.
LibreCat: https://research-explorer.ista.ac.at/record/4071
DOI: 10.1145/98524.98535

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

H. Edelsbrunner, “An acyclicity theorem for cell complexes in d dimension,” Combinatorica, vol. 10, no. 3. Springer, pp. 251–260, 1990.
LibreCat: https://research-explorer.ista.ac.at/record/4069
DOI: 10.1007/BF02122779

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

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

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

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

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

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

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

B. Chazelle, H. Edelsbrunner, L. Guibas, J. Hershberger, R. Seidel, and M. Sharir, “Slimming down by adding; selecting heavily covered points,” in Proceedings of the 6th annual symposium on computational geometry, Berkley, CA, United States, 1990, pp. 116–127.
LibreCat: https://research-explorer.ista.ac.at/record/4078
DOI: 10.1145/98524.98551

P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, and E. Welzl, “Euclidean minimum spanning trees and bichromatic closest pairs,” in Proceedings of the 6th annual symposium on Computational geometry, Berkeley, CA, United States, 1990, pp. 203–210.
LibreCat: https://research-explorer.ista.ac.at/record/4076
DOI: 10.1145/98524.98567

B. Aronov, B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, and R. Wenger, “Points and triangles in the plane and halving planes in space,” in Proceedings of the 6th annual symposium on Computational geometry, Berkley, CA, United States, 1990, pp. 112–115.
LibreCat: https://research-explorer.ista.ac.at/record/4077
DOI: 10.1145/98524.98548

D. Dobkin, H. Edelsbrunner, and M. Overmars, “Searching for empty convex polygons,” Algorithmica, vol. 5, no. 4. Springer, pp. 561–571, 1990.
LibreCat: https://research-explorer.ista.ac.at/record/4075
DOI: 10.1007/BF01840404

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