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.
1611 Publications
1987 | Book | IST-REx-ID: 3900
Edelsbrunner H. 1987. Algorithms in Combinatorial Geometry, Berlin ; Heidelberg: Springer, XV, 423p.
View
| Files available
| DOI
1986 | Journal Article | IST-REx-ID: 4098 |
Edelsbrunner H, Stöckl G. 1986. The number of extreme pairs of finite point-sets in Euclidean spaces. Journal of Combinatorial Theory Series A. 43(2), 344–349.
View
| DOI
| Download None (ext.)
1984 | Journal Article | IST-REx-ID: 4121
Day W, Edelsbrunner H. 1984. Efficient algorithms for agglomerative hierarchical clustering methods. Journal of Classification. 1, 7–24.
View
| DOI
| Download None (ext.)
1984 | Conference Paper | IST-REx-ID: 3513
Dobkin D, Edelsbrunner H. 1984. Ham-sandwich theorems applied to intersection problems. 9th International Workshop on Graph Theoretic Concepts in Computer Science. WG: International Workshop on Graph Theoretic Concepts in Computer ScienceWG, 88–99.
View
| Download None (ext.)
1984 | Conference Paper | IST-REx-ID: 4119
Edelsbrunner H, Welzl E. 1984. Monotone edge sequences in line arrangements and applications. 11th International Symposium on Mathematical Foundations of Computer Science. MFCS: Mathematical Foundations of Computer ScienceMFCS, LNCS, vol. 176, 265–272.
View
| DOI
1981 | Journal Article | IST-REx-ID: 4132 |
Edelsbrunner H, Maurer H. 1981. On the intersection of Orthogonal objects. Information Processing Letters. 13(4–5), 177–181.
[Published Version]
View
| DOI
| Download Published Version (ext.)