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. 1991. On the zone theorem for hyperplane arrangements. New Results and New Trends in Computer Science , LNCS, vol. 555, 108–123.
View
| DOI
| Download None (ext.)
1991 | Conference Paper | IST-REx-ID: 4059
Chazelle B, Edelsbrunner H, Grigni M, Guibas L, Hershberger J, Sharir M, Snoeyink J. 1991. Ray shooting in polygons using geodesic triangulations. 18th International Colloquium on Automata, Languages and Programming. ICALP: Automata, Languages and Programming, LNCS, vol. 510, 661–673.
View
| DOI
| Download None (ext.)
1991 | Journal Article | IST-REx-ID: 4061 | 
Agarwal P, Edelsbrunner H, Schwarzkopf O, Welzl E. 1991. Euclidean minimum spanning trees and bichromatic closest pairs. Discrete & Computational Geometry. 6(1), 407–422.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1990 | Journal Article | IST-REx-ID: 3651 |
Barton NH. 1990. Pleiotropic models of quantitative variation. Genetics. 124(3), 773–782.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| PubMed | Europe PMC
1990 | Conference Paper | IST-REx-ID: 4067
Edelsbrunner H, Sharir M. 1990. A hyperplane Incidence problem with applications to counting distances. Proceedings of the International Symposium on Algorithms. SIGAL: Special Interest Group on Algorithms, International Symposium on Algorithms , LNCS, vol. 450, 419–428.
View
| DOI
| Download None (ext.)
1990 | Journal Article | IST-REx-ID: 4066
Edelsbrunner H, Guibas L, Sharir M. 1990. The complexity of many cells in arrangements of planes and related problems. Discrete & Computational Geometry. 5(1), 197–216.
View
| DOI
| Download None (ext.)
1990 | Journal Article | IST-REx-ID: 4072
Edelsbrunner H, Guibas L, Sharir M. 1990. The complexity and construction of many faces in arrangements of lines and of segments. Discrete & Computational Geometry. 5(1), 161–196.
View
| DOI
| Download None (ext.)
1990 | Journal Article | IST-REx-ID: 4065
Edelsbrunner H, Robison A, Shen X. 1990. Covering convex sets with non-overlapping polygons. Discrete Mathematics. 81(2), 153–164.
View
| DOI
| Download None (ext.)
1990 | Journal Article | IST-REx-ID: 4074
Clarkson K, Edelsbrunner H, Guibas L, Sharir M, Welzl E. 1990. Combinatorial complexity bounds for arrangements of curves and spheres. Discrete & Computational Geometry. 5(1), 99–160.
View
| DOI
| Download None (ext.)
1990 | Conference Paper | IST-REx-ID: 4076
Agarwal P, Edelsbrunner H, Schwarzkopf O, Welzl E. 1990. Euclidean minimum spanning trees and bichromatic closest pairs. Proceedings of the 6th annual symposium on Computational geometry. SCG: Symposium on Computational Geometry, 203–210.
View
| DOI
| Download None (ext.)