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.
2003 Publications
1990 | Journal Article | IST-REx-ID: 4070
Edelsbrunner H, Overmars M, Welzl E, Hartman I, Feldman J. 1990. Ranking intervals under visibility constraints. International Journal of Computer Mathematics. 34(3–4), 129–144.
View
| DOI
| Download None (ext.)
1990 | Conference Paper | IST-REx-ID: 4071
Edelsbrunner H, Tan T, Waupotitsch R. 1990. An O(n^2log n) time algorithm for the MinMax angle triangulation. Proceedings of the 6th annual symposium on Computational geometry. SCG: Symposium on Computational Geometry, 44–52.
View
| DOI
| Download None (ext.)
1990 | Journal Article | IST-REx-ID: 4068
Edelsbrunner H, Sharir M. 1990. The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2. Discrete & Computational Geometry. 5(1), 35–42.
View
| DOI
| Download None (ext.)
1990 | Journal Article | IST-REx-ID: 4069
Edelsbrunner H. 1990. An acyclicity theorem for cell complexes in d dimension. Combinatorica. 10(3), 251–260.
View
| DOI
| Download None (ext.)
1990 | Book Chapter | IST-REx-ID: 3565
Dobkin D, Edelsbrunner H, Yap C. 1990.Probing convex polytopes. In: Autonomous Robot Vehicles. , 328–341.
View
| DOI
| Download None (ext.)
1990 | Journal Article | IST-REx-ID: 4064
Edelsbrunner H, Souvaine D. 1990. Computing least median of squares regression lines and guided topological sweep. Journal of the American Statistical Association. 85(409), 115–119.
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: 4078
Chazelle B, Edelsbrunner H, Guibas L, Hershberger J, Seidel R, Sharir M. 1990. Slimming down by adding; selecting heavily covered points. Proceedings of the 6th annual symposium on computational geometry. SCG: Symposium on Computational Geometry, 116–127.
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.)
1990 | Conference Paper | IST-REx-ID: 4077
Aronov B, Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Wenger R. 1990. Points and triangles in the plane and halving planes in space. Proceedings of the 6th annual symposium on Computational geometry. SCG: Symposium on Computational Geometry, 112–115.
View
| DOI
| Download None (ext.)
1990 | Conference Paper | IST-REx-ID: 4510
Henzinger TA, Manna Z, Pnueli A. 1990. An interleaving model for real time. Proceedings of the 5th Jerusalem Conference on Information Technology. JCIT: Jerusalem Conference on Information Technology, 717–730.
View
| DOI
| Download None (ext.)
1989 | Journal Article | IST-REx-ID: 4088 | 
Edelsbrunner H, Guibas L, Hershberger J, Seidel R, Sharir M, Snoeyink J, Welzl E. 1989. Implicitly representing arrangements of lines or segments. Discrete & Computational Geometry. 4(1), 433–466.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1989 | Journal Article | IST-REx-ID: 4083 |
Yao F, Dobkin D, Edelsbrunner H, Paterson M. 1989. Partitioning space for range queries. SIAM Journal on Computing. 18(2), 371–384.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1989 | Conference Paper | IST-REx-ID: 4085
Edelsbrunner H. 1989. An acyclicity theorem for cell complexes in d dimension. Proceedings of the 5th annual symposium on Computational geometry. SCG: Symposium on Computational Geometry, 145–151.
View
| DOI
| Download None (ext.)
1989 | Journal Article | IST-REx-ID: 4086 |
Edelsbrunner H. 1989. The upper envelope of piecewise linear functions: Tight bounds on the number of faces . Discrete & Computational Geometry. 4(4), 337–343.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1989 | Journal Article | IST-REx-ID: 3465
Jonas PM. 1989. Temperature dependence of gating current in myelinated nerve fibers. Journal of Membrane Biology. 112(3), 277–289.
View
| DOI
| Download None (ext.)
| PubMed | Europe PMC
1989 | Journal Article | IST-REx-ID: 4080
Edelsbrunner H, Hasan N, Seidel R, Shen X. 1989. Circles through two points that always enclose many points. Geometriae Dedicata. 32(1), 1–12.
View
| DOI
| Download None (ext.)
1989 | Journal Article | IST-REx-ID: 4314
Barton NH. 1989. The divergence of a polygenic system under stabilising selection, mutation and drift. Genetical Research. 54(1), 59–78.
View
| DOI
| Download None (ext.)
| PubMed | Europe PMC
1989 | Conference Paper | IST-REx-ID: 4596
Alur R, Henzinger TA. 1989. A really temporal logic. 30th Annual Symposium on Foundations of Computer Science. FOCS: Foundations of Computer ScienceFCOS, 164–169.
View
| DOI
| Download None (ext.)