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.
2006 Publications
1991 | Journal Article | IST-REx-ID: 4061 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Euclidean minimum spanning trees and bichromatic closest pairs
P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, E. Welzl, Discrete & Computational Geometry 6 (1991) 407–422.
[Published Version]
View
| DOI
| Download Published Version (ext.)
P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, E. Welzl, Discrete & Computational Geometry 6 (1991) 407–422.
1990 | Journal Article | IST-REx-ID: 2480 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Cloning and expression of a rat neuromedin K receptor cDNA
R. Shigemoto, Y. Yokota, K. Tsuchida, S. Nakanishi, Journal of Biological Chemistry 265 (1990) 623–628.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| PubMed | Europe PMC
R. Shigemoto, Y. Yokota, K. Tsuchida, S. Nakanishi, Journal of Biological Chemistry 265 (1990) 623–628.
1990 | Journal Article | IST-REx-ID: 4066
The complexity of many cells in arrangements of planes and related problems
H. Edelsbrunner, L. Guibas, M. Sharir, Discrete & Computational Geometry 5 (1990) 197–216.
View
| DOI
| Download None (ext.)
H. Edelsbrunner, L. Guibas, M. Sharir, Discrete & Computational Geometry 5 (1990) 197–216.
1990 | Journal Article | IST-REx-ID: 4070
Ranking intervals under visibility constraints
H. Edelsbrunner, M. Overmars, E. Welzl, I. Hartman, J. Feldman, International Journal of Computer Mathematics 34 (1990) 129–144.
View
| DOI
| Download None (ext.)
H. Edelsbrunner, M. Overmars, E. Welzl, I. Hartman, J. Feldman, International Journal of Computer Mathematics 34 (1990) 129–144.
1990 | Conference Paper | IST-REx-ID: 4071
An O(n^2log n) time algorithm for the MinMax angle triangulation
H. Edelsbrunner, T. Tan, R. Waupotitsch, in:, Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 44–52.
View
| DOI
| Download None (ext.)
H. Edelsbrunner, T. Tan, R. Waupotitsch, in:, Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 44–52.
1990 | Journal Article | IST-REx-ID: 4068
The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2
H. Edelsbrunner, M. Sharir, Discrete & Computational Geometry 5 (1990) 35–42.
View
| DOI
| Download None (ext.)
H. Edelsbrunner, M. Sharir, Discrete & Computational Geometry 5 (1990) 35–42.
1990 | Journal Article | IST-REx-ID: 4069
An acyclicity theorem for cell complexes in d dimension
H. Edelsbrunner, Combinatorica 10 (1990) 251–260.
View
| DOI
| Download None (ext.)
H. Edelsbrunner, Combinatorica 10 (1990) 251–260.
1990 | Book Chapter | IST-REx-ID: 3565
Probing convex polytopes
D. Dobkin, H. Edelsbrunner, C. Yap, in:, I. Cox, G. Wilfong (Eds.), Autonomous Robot Vehicles, Springer, 1990, pp. 328–341.
View
| DOI
| Download None (ext.)
D. Dobkin, H. Edelsbrunner, C. Yap, in:, I. Cox, G. Wilfong (Eds.), Autonomous Robot Vehicles, Springer, 1990, pp. 328–341.
1990 | Journal Article | IST-REx-ID: 4064
Computing least median of squares regression lines and guided topological sweep
H. Edelsbrunner, D. Souvaine, Journal of the American Statistical Association 85 (1990) 115–119.
View
| DOI
| Download None (ext.)
H. Edelsbrunner, D. Souvaine, Journal of the American Statistical Association 85 (1990) 115–119.
1990 | Journal Article | IST-REx-ID: 4065
Covering convex sets with non-overlapping polygons
H. Edelsbrunner, A. Robison, X. Shen, Discrete Mathematics 81 (1990) 153–164.
View
| DOI
| Download None (ext.)
H. Edelsbrunner, A. Robison, X. Shen, Discrete Mathematics 81 (1990) 153–164.