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. Taylor & Francis. https://doi.org/10.1080/00207169008803871
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. In Proceedings of the 6th annual symposium on Computational geometry (pp. 44–52). Berkley, CA, United States: ACM. https://doi.org/10.1145/98524.98535
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. Springer. https://doi.org/10.1007/BF02187778
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. Springer. https://doi.org/10.1007/BF02122779
View
| DOI
| Download None (ext.)
1990 | Book Chapter | IST-REx-ID: 3565
Dobkin, D., Edelsbrunner, H., & Yap, C. (1990). Probing convex polytopes. In I. Cox & G. Wilfong (Eds.), Autonomous Robot Vehicles (pp. 328–341). Springer. https://doi.org/10.1007/978-1-4613-8997-2_25
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. American Statistical Association. https://doi.org/10.1080/01621459.1990.10475313
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. Elsevier. https://doi.org/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. (1990). Combinatorial complexity bounds for arrangements of curves and spheres. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/BF02187783
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. In Proceedings of the 6th annual symposium on computational geometry (pp. 116–127). Berkley, CA, United States: ACM. https://doi.org/10.1145/98524.98551
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. In Proceedings of the 6th annual symposium on Computational geometry (pp. 203–210). Berkeley, CA, United States: ACM. https://doi.org/10.1145/98524.98567
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. In Proceedings of the 6th annual symposium on Computational geometry (pp. 112–115). Berkley, CA, United States: ACM. https://doi.org/10.1145/98524.98548
View
| DOI
| Download None (ext.)
1990 | Conference Paper | IST-REx-ID: 4510
Henzinger, T. A., Manna, Z., & Pnueli, A. (1990). An interleaving model for real time. In Proceedings of the 5th Jerusalem Conference on Information Technology (pp. 717–730). Jerusalem, Israel: IEEE. https://doi.org/10.1109/JCIT.1990.128356
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. Springer. https://doi.org/10.1007/BF02187742
[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. SIAM. https://doi.org/10.1137/0218025
[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. In Proceedings of the 5th annual symposium on Computational geometry (pp. 145–151). Saarbruchen, Germany: ACM. https://doi.org/10.1145/73833.73850
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. Springer. https://doi.org/10.1007/BF02187734
[Published Version]
View
| DOI
| Download Published Version (ext.)
1989 | Journal Article | IST-REx-ID: 3465
Jonas, P. M. (1989). Temperature dependence of gating current in myelinated nerve fibers. Journal of Membrane Biology. Springer. https://doi.org/10.1007/BF01870958
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. Springer. https://doi.org/10.1007/BF00181432
View
| DOI
| Download None (ext.)
1989 | Journal Article | IST-REx-ID: 4314
Barton, N. H. (1989). The divergence of a polygenic system under stabilising selection, mutation and drift. Genetical Research. Cambridge University Press. https://doi.org/10.1017/S0016672300028378
View
| DOI
| Download None (ext.)
| PubMed | Europe PMC
1989 | Conference Paper | IST-REx-ID: 4596
Alur, R., & Henzinger, T. A. (1989). A really temporal logic. In 30th Annual Symposium on Foundations of Computer Science (pp. 164–169). Research Triangle Park, NC, USA: IEEE. https://doi.org/10.1109/SFCS.1989.63473
View
| DOI
| Download None (ext.)