Please note that IST 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.

6113 Publications


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
View | DOI
 

1989 | Conference Paper | IST-REx-ID: 4085
Edelsbrunner, H. (1989). An acyclicity theorem for cell complexes in d dimension (pp. 145–151). Presented at the SCG: Symposium on Computational Geometry, ACM. https://doi.org/10.1145/73833.73850
View | DOI
 

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
View | DOI
 

1989 | Conference Paper | IST-REx-ID: 4087
Edelsbrunner, H., Preparata, F., & West, D. (1989). Tetrahedrizing point sets in three dimensions (Vol. 358, pp. 315–331). Presented at the ISSAC: International Symposium on Symbolic and Algebraic Computation, Springer. https://doi.org/10.1007/3-540-51084-2_31
View | DOI
 

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
View | DOI
 

Search

Filter Publications