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.
2004 Publications
1990 | Journal Article | IST-REx-ID: 4066
H. Edelsbrunner, L. Guibas, and M. Sharir, “The complexity of many cells in arrangements of planes and related problems,” Discrete & Computational Geometry, vol. 5, no. 1. Springer, pp. 197–216, 1990.
View
| DOI
| Download None (ext.)
1990 | Journal Article | IST-REx-ID: 4070
H. Edelsbrunner, M. Overmars, E. Welzl, I. Hartman, and J. Feldman, “Ranking intervals under visibility constraints,” International Journal of Computer Mathematics, vol. 34, no. 3–4. Taylor & Francis, pp. 129–144, 1990.
View
| DOI
| Download None (ext.)
1990 | Conference Paper | IST-REx-ID: 4071
H. Edelsbrunner, T. Tan, and R. Waupotitsch, “An O(n^2log n) time algorithm for the MinMax angle triangulation,” in Proceedings of the 6th annual symposium on Computational geometry, Berkley, CA, United States, 1990, pp. 44–52.
View
| DOI
| Download None (ext.)
1990 | Journal Article | IST-REx-ID: 4068
H. Edelsbrunner and M. Sharir, “The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2,” Discrete & Computational Geometry, vol. 5, no. 1. Springer, pp. 35–42, 1990.
View
| DOI
| Download None (ext.)
1990 | Journal Article | IST-REx-ID: 4069
H. Edelsbrunner, “An acyclicity theorem for cell complexes in d dimension,” Combinatorica, vol. 10, no. 3. Springer, pp. 251–260, 1990.
View
| DOI
| Download None (ext.)
1990 | Book Chapter | IST-REx-ID: 3565
D. Dobkin, H. Edelsbrunner, and C. Yap, “Probing convex polytopes,” in Autonomous Robot Vehicles, I. Cox and G. Wilfong, Eds. Springer, 1990, pp. 328–341.
View
| DOI
| Download None (ext.)
1990 | Journal Article | IST-REx-ID: 4064
H. Edelsbrunner and D. Souvaine, “Computing least median of squares regression lines and guided topological sweep,” Journal of the American Statistical Association, vol. 85, no. 409. American Statistical Association, pp. 115–119, 1990.
View
| DOI
| Download None (ext.)
1990 | Journal Article | IST-REx-ID: 4065
H. Edelsbrunner, A. Robison, and X. Shen, “Covering convex sets with non-overlapping polygons,” Discrete Mathematics, vol. 81, no. 2. Elsevier, pp. 153–164, 1990.
View
| DOI
| Download None (ext.)
1990 | Journal Article | IST-REx-ID: 4074
K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, and E. Welzl, “Combinatorial complexity bounds for arrangements of curves and spheres,” Discrete & Computational Geometry, vol. 5, no. 1. Springer, pp. 99–160, 1990.
View
| DOI
| Download None (ext.)
1990 | Conference Paper | IST-REx-ID: 4078
B. Chazelle, H. Edelsbrunner, L. Guibas, J. Hershberger, R. Seidel, and M. Sharir, “Slimming down by adding; selecting heavily covered points,” in Proceedings of the 6th annual symposium on computational geometry, Berkley, CA, United States, 1990, pp. 116–127.
View
| DOI
| Download None (ext.)
1990 | Conference Paper | IST-REx-ID: 4076
P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, and E. Welzl, “ Euclidean minimum spanning trees and bichromatic closest pairs,” in Proceedings of the 6th annual symposium on Computational geometry, Berkeley, CA, United States, 1990, pp. 203–210.
View
| DOI
| Download None (ext.)
1990 | Conference Paper | IST-REx-ID: 4077
B. Aronov, B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, and R. Wenger, “Points and triangles in the plane and halving planes in space,” in Proceedings of the 6th annual symposium on Computational geometry, Berkley, CA, United States, 1990, pp. 112–115.
View
| DOI
| Download None (ext.)
1990 | Conference Paper | IST-REx-ID: 4510
T. A. Henzinger, Z. Manna, and A. Pnueli, “An interleaving model for real time,” in Proceedings of the 5th Jerusalem Conference on Information Technology, Jerusalem, Israel, 1990, pp. 717–730.
View
| DOI
| Download None (ext.)
1989 | Journal Article | IST-REx-ID: 4088 | 
H. Edelsbrunner et al., “Implicitly representing arrangements of lines or segments,” Discrete & Computational Geometry, vol. 4, no. 1. Springer, pp. 433–466, 1989.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1989 | Journal Article | IST-REx-ID: 4083 |
F. Yao, D. Dobkin, H. Edelsbrunner, and M. Paterson, “Partitioning space for range queries,” SIAM Journal on Computing, vol. 18, no. 2. SIAM, pp. 371–384, 1989.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1989 | Conference Paper | IST-REx-ID: 4085
H. Edelsbrunner, “An acyclicity theorem for cell complexes in d dimension,” in Proceedings of the 5th annual symposium on Computational geometry, Saarbruchen, Germany, 1989, pp. 145–151.
View
| DOI
| Download None (ext.)
1989 | Journal Article | IST-REx-ID: 4086 |
H. Edelsbrunner, “The upper envelope of piecewise linear functions: Tight bounds on the number of faces ,” Discrete & Computational Geometry, vol. 4, no. 4. Springer, pp. 337–343, 1989.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1989 | Journal Article | IST-REx-ID: 3465
P. M. Jonas, “Temperature dependence of gating current in myelinated nerve fibers,” Journal of Membrane Biology, vol. 112, no. 3. Springer, pp. 277–289, 1989.
View
| DOI
| Download None (ext.)
| PubMed | Europe PMC
1989 | Journal Article | IST-REx-ID: 4080
H. Edelsbrunner, N. Hasan, R. Seidel, and X. Shen, “Circles through two points that always enclose many points,” Geometriae Dedicata, vol. 32, no. 1. Springer, pp. 1–12, 1989.
View
| DOI
| Download None (ext.)
1989 | Journal Article | IST-REx-ID: 4314
N. H. Barton, “The divergence of a polygenic system under stabilising selection, mutation and drift,” Genetical Research, vol. 54, no. 1. Cambridge University Press, pp. 59–78, 1989.
View
| DOI
| Download None (ext.)
| PubMed | Europe PMC