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.
1776 Publications
1991 | Conference Paper | IST-REx-ID: 4054
Edelsbrunner H, Seidel R, Sharir M. On the zone theorem for hyperplane arrangements. In: Vol 555. Springer; 1991:108-123. doi:10.1007/BFb0038185
View
| DOI
| Download None (ext.)
1991 | Conference Paper | IST-REx-ID: 4059
Chazelle B, Edelsbrunner H, Grigni M, et al. Ray shooting in polygons using geodesic triangulations. In: 18th International Colloquium on Automata, Languages and Programming. Vol 510. Springer; 1991:661-673. doi:10.1007/3-540-54233-7_172
View
| DOI
| Download None (ext.)
1991 | Journal Article | IST-REx-ID: 4061 | 
Agarwal P, Edelsbrunner H, Schwarzkopf O, Welzl E. Euclidean minimum spanning trees and bichromatic closest pairs. Discrete & Computational Geometry. 1991;6(1):407-422. doi:10.1007/BF02574698
[Published Version]
View
| DOI
| Download Published Version (ext.)
1990 | Journal Article | IST-REx-ID: 3651 |
Barton NH. Pleiotropic models of quantitative variation. Genetics. 1990;124(3):773-782. doi:10.1093/genetics/124.3.773
[Published Version]
View
| DOI
| Download Published Version (ext.)
| PubMed | Europe PMC
1990 | Conference Paper | IST-REx-ID: 4067
Edelsbrunner H, Sharir M. A hyperplane Incidence problem with applications to counting distances. In: Proceedings of the International Symposium on Algorithms. Vol 450. Springer; 1990:419-428. doi:10.1007/3-540-52921-7_91
View
| DOI
| Download None (ext.)
1990 | Journal Article | IST-REx-ID: 4066
Edelsbrunner H, Guibas L, Sharir M. The complexity of many cells in arrangements of planes and related problems. Discrete & Computational Geometry. 1990;5(1):197-216. doi:10.1007/BF02187785
View
| DOI
| Download None (ext.)
1990 | Journal Article | IST-REx-ID: 4072
Edelsbrunner H, Guibas L, Sharir M. The complexity and construction of many faces in arrangements of lines and of segments. Discrete & Computational Geometry. 1990;5(1):161-196. doi:10.1007/BF02187784
View
| DOI
| Download None (ext.)
1990 | Journal Article | IST-REx-ID: 4065
Edelsbrunner H, Robison A, Shen X. Covering convex sets with non-overlapping polygons. Discrete Mathematics. 1990;81(2):153-164. doi:10.1016/0012-365X(90)90147-A
View
| DOI
| Download None (ext.)
1990 | Journal Article | IST-REx-ID: 4074
Clarkson K, Edelsbrunner H, Guibas L, Sharir M, Welzl E. Combinatorial complexity bounds for arrangements of curves and spheres. Discrete & Computational Geometry. 1990;5(1):99-160. doi:10.1007/BF02187783
View
| DOI
| Download None (ext.)
1990 | Conference Paper | IST-REx-ID: 4076
Agarwal P, Edelsbrunner H, Schwarzkopf O, Welzl E. Euclidean minimum spanning trees and bichromatic closest pairs. In: Proceedings of the 6th Annual Symposium on Computational Geometry. ACM; 1990:203-210. doi:10.1145/98524.98567
View
| DOI
| Download None (ext.)