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.
1608 Publications
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 | 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.)
1988 | Conference Paper | IST-REx-ID: 4097
Edelsbrunner, H., Guibas, L., Pach, J., Pollack, R., Seidel, R., & Sharir, M. (1988). Arrangements of curves in the plane - topology, combinatorics, and algorithms. In 15th International Colloquium on Automata, Languages and Programming (Vol. 317, pp. 214–229). Tampere, Finland: Springer. https://doi.org/10.1007/3-540-19488-6_118
View
| DOI
| Download None (ext.)
1988 | Conference Paper | IST-REx-ID: 4096
Edelsbrunner, H. (1988). Geometric structures in computational geometry. In 15th International Colloquium on Automata, Languages and Programming (Vol. 317, pp. 201–213). Tampere, Finland: Springer. https://doi.org/10.1007/3-540-19488-6_117
View
| DOI
| Download None (ext.)
1987 | Journal Article | IST-REx-ID: 4100
Chazelle, B., & Edelsbrunner, H. (1987). Linear space data structures for two types of range search. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/BF02187875
View
| DOI
1987 | Book | IST-REx-ID: 3900
Edelsbrunner, H. (1987). Algorithms in Combinatorial Geometry (Vol. 10). Berlin ; Heidelberg: Springer. https://doi.org/10.1007/978-3-642-61568-9
View
| Files available
| DOI
1986 | Journal Article | IST-REx-ID: 3580
Edelsbrunner, H. (1986). Edge-skeletons in arrangements with applications. Algorithmica. Springer. https://doi.org/10.1007/BF01840438
View
| DOI
1986 | Journal Article | IST-REx-ID: 4098 |
Edelsbrunner, H., & Stöckl, G. (1986). The number of extreme pairs of finite point-sets in Euclidean spaces. Journal of Combinatorial Theory Series A. Elsevier. https://doi.org/10.1016/0097-3165(86)90075-0
View
| DOI
| Download None (ext.)