Edelsbrunner, Herbert, and Micha Sharir. “A Hyperplane Incidence Problem with Applications to Counting Distances.”https://doi.org/10.1007/3-540-52921-7_91__In Proceedings of the International Symposium on Algorithms, 450:419–28. Springer, 1990.https://doi.org/10.1007/3-540-52921-7_91 .

Edelsbrunner, Herbert, Leonidas Guibas, and Micha Sharir. “The Complexity of Many Cells in Arrangements of Planes and Related Problems.”https://doi.org/10.1007/BF02187785__Discrete &; Computational Geometry. Springer, 1990.https://doi.org/10.1007/BF02187785 .

Edelsbrunner, Herbert, Leonidas Guibas, and Micha Sharir. “The Complexity and Construction of Many Faces in Arrangements of Lines and of Segments.”https://doi.org/10.1007/BF02187784__Discrete &; Computational Geometry. Springer, 1990.https://doi.org/10.1007/BF02187784 .

Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, and Jack Snoeyink. “Counting and Cutting Cycles of Lines and Rods in Space.”https://doi.org/10.1109/FSCS.1990.89543__In 31st Annual Symposium on Foundations of Computer Science, 242–51. IEEE, 1990.https://doi.org/10.1109/FSCS.1990.89543 .

Edelsbrunner, Herbert, Mark Overmars, Emo Welzl, Irith Hartman, and Jack Feldman. “Ranking Intervals under Visibility Constraints.”https://doi.org/10.1080/00207169008803871__International Journal of Computer Mathematics. Taylor &; Francis, 1990.https://doi.org/10.1080/00207169008803871 .

Edelsbrunner, Herbert, Tiow Tan, and Roman Waupotitsch. “An O(N^2log n) Time Algorithm for the MinMax Angle Triangulation.”https://doi.org/10.1145/98524.98535__In Proceedings of the 6th Annual Symposium on Computational Geometry, 44–52. ACM, 1990.https://doi.org/10.1145/98524.98535 .

Edelsbrunner, Herbert, and Micha Sharir. “The Maximum Number of Ways to Stabn Convex Nonintersecting Sets in the Plane Is 2n2.”https://doi.org/10.1007/BF02187778__Discrete &; Computational Geometry. Springer, 1990.https://doi.org/10.1007/BF02187778 .

Edelsbrunner, Herbert. “An Acyclicity Theorem for Cell Complexes in d Dimension.”https://doi.org/10.1007/BF02122779__Combinatorica. Springer, 1990.https://doi.org/10.1007/BF02122779 .

Bräu, Michael, Florian Dreyer, Peter M Jonas, Holger Repp, and Werner Vogel. “A K+ Channel in Xenopus Nerve Fibres Selectively Blocked by Bee and Snake Toxins: Binding and Voltage-Clamp Experiments.”https://doi.org/10.1113/jphysiol.1990.sp017918__Journal of Physiology. Wiley-Blackwell, 1990.https://doi.org/10.1113/jphysiol.1990.sp017918 .

Dobkin, David, Herbert Edelsbrunner, and Chee Yap. “Probing Convex Polytopes.”https://doi.org/10.1007/978-1-4613-8997-2_25__In Autonomous Robot Vehicles, edited by Ingemar Cox and Gordon Wilfong, 328–41. Springer, 1990.https://doi.org/10.1007/978-1-4613-8997-2_25 .

Edelsbrunner, Herbert, and Diane Souvaine. “Computing Least Median of Squares Regression Lines and Guided Topological Sweep.”https://doi.org/10.1080/01621459.1990.10475313__Journal of the American Statistical Association. American Statistical Association, 1990.https://doi.org/10.1080/01621459.1990.10475313 .

Edelsbrunner, Herbert, and Ernst Mücke. “Simulation of Simplicity: A Technique to Cope with Degenerate Cases in Geometric Algorithms.”https://doi.org/10.1145/77635.77639__ACM Transactions on Graphics. ACM, 1990.https://doi.org/10.1145/77635.77639 .

Edelsbrunner, Herbert, Franco Preparata, and Douglas West. “Tetrahedrizing Point Sets in Three Dimensions.”https://doi.org/10.1016/S0747-7171(08)80068-5__Journal of Symbolic Computation. Elsevier, 1990.https://doi.org/10.1016/S0747-7171(08)80068-5 .

Edelsbrunner, Herbert, Arch Robison, and Xiao Shen. “Covering Convex Sets with Non-Overlapping Polygons.”https://doi.org/10.1016/0012-365X(90)90147-A__Discrete Mathematics. Elsevier, 1990.https://doi.org/10.1016/0012-365X(90)90147-A .

Clarkson, Kenneth, Herbert Edelsbrunner, Leonidas Guibas, Micha Sharir, and Emo Welzl. “Combinatorial Complexity Bounds for Arrangements of Curves and Spheres.”https://doi.org/10.1007/BF02187783__Discrete &; Computational Geometry. Springer, 1990.https://doi.org/10.1007/BF02187783 .

Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, John Hershberger, Raimund Seidel, and Micha Sharir. “Slimming down by Adding; Selecting Heavily Covered Points.”https://doi.org/10.1145/98524.98551__In Proceedings of the 6th Annual Symposium on Computational Geometry, 116–27. ACM, 1990.https://doi.org/10.1145/98524.98551 .

Agarwal, Pankaj, Herbert Edelsbrunner, Otfried Schwarzkopf, and Emo Welzl. “Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.”https://doi.org/10.1145/98524.98567__In Proceedings of the 6th Annual Symposium on Computational Geometry, 203–10. ACM, 1990.https://doi.org/10.1145/98524.98567 .

Aronov, Boris, Bernard Chazelle, Herbert Edelsbrunner, Leonidas Guibas, Micha Sharir, and Rephael Wenger. “Points and Triangles in the Plane and Halving Planes in Space.”https://doi.org/10.1145/98524.98548__In Proceedings of the 6th Annual Symposium on Computational Geometry, 112–15. ACM, 1990.https://doi.org/10.1145/98524.98548 .

Dobkin, David, Herbert Edelsbrunner, and Mark Overmars. “Searching for Empty Convex Polygons.”https://doi.org/10.1007/BF01840404__Algorithmica. Springer, 1990.https://doi.org/10.1007/BF01840404 .

Barton, Nicholas H, and A. Clark. “Population Structure and Processes in Evolution.”https://doi.org/10.1007/978-3-642-74474-7_5__In Population Biology: Ecological and Evolutionary Viewpoints, edited by Klaus Wöhrmann and Subodh Jain, 115–74. Springer, 1990.https://doi.org/10.1007/978-3-642-74474-7_5 .