Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
6934 Publications
1986 | Journal Article | IST-REx-ID: 4110
Edelsbrunner, Herbert, and Emo Welzl. “Constructing Belts in Two-Dimensional Arrangements with Applications.” SIAM Journal on Computing, vol. 15, no. 1, SIAM, 1986, pp. 271–84, doi:10.1137/0215019.
View
| DOI
1986 | Journal Article | IST-REx-ID: 4106
Edelsbrunner, Herbert, and Roman Waupotitsch. “Computing a Ham-Sandwich Cut in Two Dimensions.” Journal of Symbolic Computation, vol. 2, no. 2, Elsevier, 1986, pp. 171–78, doi:10.1016/S0747-7171(86)80020-7.
View
| DOI
1986 | Journal Article | IST-REx-ID: 4109
Edelsbrunner, Herbert, et al. “Rectangular Point Location in D-Dimensions with Applications.” Computer Journal, vol. 29, no. 1, Oxford University Press, 1986, pp. 76–82, doi:10.1093/comjnl/29.1.76.
View
| DOI
1986 | Journal Article | IST-REx-ID: 4107
Edelsbrunner, Herbert, and David Haussler. “The Complexity of Cells in 3-Dimensional Arrangements.” Discrete Mathematics, vol. 60, no. C, Elsevier, 1986, pp. 139–46, doi:10.1016/0012-365X(86)90008-7.
View
| DOI
1985 | Book Chapter | IST-REx-ID: 4241
Curtis, C., et al. “Methodology for Testing the Hypothesis of Single Locus Control of Host Resistance to Infection and Malignancy.” Genetic Control of Host Resistance to Infection and Malignancy, edited by Emil Skamene, vol. 3, Liss, 1985.
View
1985 | Journal Article | IST-REx-ID: 4325
Jones, Steve, and Nicholas H. Barton. “Haldane’s Rule OK.” Nature, vol. 314, Nature Publishing Group, 1985, pp. 668–668, doi:10.1038/314668a0.
View
| DOI
| PubMed | Europe PMC
1985 | Journal Article | IST-REx-ID: 4112
Edelsbrunner, Herbert, and Mark Overmars. “Batched Dynamic Solutions to Decomposable Searching Problems.” Journal of Algorithms, vol. 6, no. 4, Elsevier, 1985, pp. 515–42, doi:10.1016/0196-6774(85)90030-6.
View
| DOI
1985 | Journal Article | IST-REx-ID: 4113
Edelsbrunner, Herbert, and Emo Welzl. “On the Number of Line Separations of a Finite Set in the Plane.” Journal of Combinatorial Theory Series A, vol. 38, no. 1, Elsevier, 1985, pp. 15–29, doi:10.1016/0097-3165(85)90017-2.
View
| DOI
1985 | Journal Article | IST-REx-ID: 4111
Edelsbrunner, Herbert, and Hermann Maurer. “Finding Extreme-Points in 3-Dimensions and Solving the Post-Office Problem in the Plane.” Information Processing Letters, vol. 21, no. 1, Elsevier, 1985, pp. 39–47, doi:10.1016/0020-0190(85)90107-3.
View
| DOI
1985 | Journal Article | IST-REx-ID: 4120 | 
Chazelle, Bernard, and Herbert Edelsbrunner. “Optimal Solutions for a Class of Point Retrieval Problems.” Journal of Symbolic Computation, vol. 1, no. 1, Elsevier, 1985, pp. 47–56, doi:10.1016/S0747-7171(85)80028-6.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1985 | Journal Article | IST-REx-ID: 4116 |
Edelsbrunner, Herbert. “Finding Transversals for Sets of Simple Geometric-Figures.” Theoretical Computer Science, vol. 35, no. 1, Elsevier, 1985, pp. 55–69, doi:10.1016/0304-3975(85)90005-2.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1985 | Journal Article | IST-REx-ID: 4114
Day, William, and Herbert Edelsbrunner. “Investigation of Proportional Link Linkage Clustering Methods.” Journal of Classification, vol. 2, no. 2–3, Springer, 1985, pp. 239–54, doi:10.1007/BF01908077.
View
| DOI
1985 | Journal Article | IST-REx-ID: 4115
Edelsbrunner, Herbert. “Computing the Extreme Distances between Two Convex Polygons.” Journal of Algorithms, vol. 6, no. 2, Academic Press, 1985, pp. 213–24, doi:10.1016/0196-6774(85)90039-2.
View
| DOI
1985 | Journal Article | IST-REx-ID: 4326
Barton, Nicholas H., and Godfrey Hewitt. “Analysis of Hybrid Zones.” Annual Review of Ecology and Systematics, vol. 16, Annual Reviews, 1985, pp. 113–48, doi:10.1146/annurev.es.16.110185.000553.
View
| DOI
1984 | Journal Article | IST-REx-ID: 4121
Day, William, and Herbert Edelsbrunner. “Efficient Algorithms for Agglomerative Hierarchical Clustering Methods.” Journal of Classification, vol. 1, Springer, 1984, pp. 7–24, doi:10.1007/BF01890115.
View
| DOI
| Download None (ext.)
1984 | Conference Paper | IST-REx-ID: 4122
Edelsbrunner, Herbert. “Key-Problems and Key-Methods in Computational Geometry.” 1st Symposium of Theoretical Aspects of Computer Science, vol. 166, Springer, 1984, pp. 1–13, doi:10.1007/3-540-12920-0_1.
View
| DOI
1984 | Journal Article | IST-REx-ID: 4123
Edelsbrunner, Herbert, et al. “Some Methods of Computational Geometry Applied to Computer Graphics.” Computer Vision, Graphics, and Image Processing, vol. 28, no. 1, Elsevier, 1984, pp. 92–108, doi:10.1016/0734-189X(84)90142-7.
View
| DOI
1984 | Conference Paper | IST-REx-ID: 3513
Dobkin, David, and Herbert Edelsbrunner. “Ham-Sandwich Theorems Applied to Intersection Problems.” 9th International Workshop on Graph Theoretic Concepts in Computer Science, Teubner, 1984, pp. 88–99.
View
| Download None (ext.)
1984 | Journal Article | IST-REx-ID: 4117
Edelsbrunner, Herbert, et al. “Computing the Connected Components of Simple Rectilinear Geometrical Objects in D-Space.” Rairo-Informatique Theorique Et Applications-Theoretical Informatics and Applications, vol. 18, no. 2, EDP Sciences, 1984, pp. 171–83, doi:10.1051/ita/1984180201711.
View
| DOI
1984 | Conference Paper | IST-REx-ID: 4119
Edelsbrunner, Herbert, and Emo Welzl. “Monotone Edge Sequences in Line Arrangements and Applications.” 11th International Symposium on Mathematical Foundations of Computer Science, vol. 176, Springer, 1984, pp. 265–72, doi:10.1007/BFb0030307.
View
| DOI