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.
28 Publications
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 | Journal Article | IST-REx-ID: 4084 |
Edelsbrunner, H., Rote, G., & Welzl, E. (1989). Testing the necklace condition for shortest tours and optimal factors in the plane. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/0304-3975(89)90133-3
[Published Version]
View
| DOI
| Download Published Version (ext.)
1989 | Conference Paper | IST-REx-ID: 4087
Edelsbrunner, H., Preparata, F., & West, D. (1989). Tetrahedrizing point sets in three dimensions. In International Symposium on Symbolic and Algebraic Computation (Vol. 358, pp. 315–331). Rome, Italy: Springer. https://doi.org/10.1007/3-540-51084-2_31
View
| DOI
| Download None (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.)