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.
1772 Publications
1986 | Published | Journal Article | IST-REx-ID: 3580
Edelsbrunner, Herbert. “Edge-Skeletons in Arrangements with Applications.” Algorithmica. Springer, 1986. https://doi.org/10.1007/BF01840438.
View
| DOI
1986 | Published | Journal Article | IST-REx-ID: 4103 | 
Edelsbrunner, Herbert, and Emo Welzl. “On the Maximal Number of Edges of Many Faces in an Arrangement.” Journal of Combinatorial Theory Series A. Elsevier, 1986. https://doi.org/10.1016/0097-3165(86)90078-6.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1986 | Published | Journal Article | IST-REx-ID: 4105
Edelsbrunner, Herbert, Joseph O’Rourke, and Raimund Seidel. “Constructing Arrangements of Lines and Hyperplanes with Applications.” SIAM Journal on Computing. SIAM, 1986. https://doi.org/10.1137/0215024.
View
| DOI
1985 | Published | 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. Elsevier, 1985. https://doi.org/10.1016/0097-3165(85)90017-2.
View
| DOI
1985 | Published | Journal Article | IST-REx-ID: 4114
Day, William, and Herbert Edelsbrunner. “Investigation of Proportional Link Linkage Clustering Methods.” Journal of Classification. Springer, 1985. https://doi.org/10.1007/BF01908077.
View
| DOI
1985 | Published | Journal Article | IST-REx-ID: 4115
Edelsbrunner, Herbert. “Computing the Extreme Distances between Two Convex Polygons.” Journal of Algorithms. Academic Press, 1985. https://doi.org/10.1016/0196-6774(85)90039-2.
View
| DOI
1985 | Published | Journal Article | IST-REx-ID: 4116 |
Edelsbrunner, Herbert. “Finding Transversals for Sets of Simple Geometric-Figures.” Theoretical Computer Science. Elsevier, 1985. https://doi.org/10.1016/0304-3975(85)90005-2.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1984 | Published | Journal Article | IST-REx-ID: 4121
Day, William, and Herbert Edelsbrunner. “Efficient Algorithms for Agglomerative Hierarchical Clustering Methods.” Journal of Classification. Springer, 1984. https://doi.org/10.1007/BF01890115.
View
| DOI
| Download None (ext.)
1984 | Published | Journal Article | IST-REx-ID: 4123
Edelsbrunner, Herbert, Mark Overmars, and Raimund Seidel. “Some Methods of Computational Geometry Applied to Computer Graphics.” Computer Vision, Graphics, and Image Processing. Elsevier, 1984. https://doi.org/10.1016/0734-189X(84)90142-7.
View
| DOI
1983 | Published | Journal Article | IST-REx-ID: 3667 |
Barton, Nicholas H, Bruce Halliday, and Godfrey Hewitt. “Rare Electrophoretic Variants in a Hybrid Zone.” Heredity. Nature Publishing Group, 1983. https://doi.org/10.1038/hdy.1983.15.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1983 | Published | Journal Article | IST-REx-ID: 4127
Edelsbrunner, Herbert. “A New Approach to Rectangle Intersections Part 2.” International Journal of Computer Mathematics. Taylor & Francis, 1983. https://doi.org/10.1080/00207168308803365.
View
| DOI
1982 | Published | Journal Article | IST-REx-ID: 3669 |
Barton, Nicholas H, and Godfrey Hewitt. “A Measurement of Dispersal in the Grasshopper Podisma Pedestris (Orthoptera: Acrididae).” Heredity. Springer Nature, 1982. https://doi.org/10.1038/hdy.1982.29.
[Published Version]
View
| DOI
| Download Published Version (ext.)