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., David Dobkin, Herbert Edelsbrunner, and Michael Paterson. “Partitioning Space for Range Queries.” SIAM Journal on Computing. SIAM, 1989. https://doi.org/10.1137/0218025.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1989 | Journal Article | IST-REx-ID: 4084 |
Edelsbrunner, Herbert, Günter Rote, and Emo Welzl. “Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane.” Theoretical Computer Science. Elsevier, 1989. 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, Herbert, Franco Preparata, and Douglas West. “Tetrahedrizing Point Sets in Three Dimensions.” In International Symposium on Symbolic and Algebraic Computation, 358:315–31. Springer, 1989. https://doi.org/10.1007/3-540-51084-2_31.
View
| DOI
| Download None (ext.)
1989 | Conference Paper | IST-REx-ID: 4085
Edelsbrunner, Herbert. “An Acyclicity Theorem for Cell Complexes in d Dimension.” In Proceedings of the 5th Annual Symposium on Computational Geometry, 145–51. ACM, 1989. https://doi.org/10.1145/73833.73850.
View
| DOI
| Download None (ext.)
1989 | Journal Article | IST-REx-ID: 4086 |
Edelsbrunner, Herbert. “The Upper Envelope of Piecewise Linear Functions: Tight Bounds on the Number of Faces .” Discrete & Computational Geometry. Springer, 1989. https://doi.org/10.1007/BF02187734.
[Published Version]
View
| DOI
| Download Published Version (ext.)