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.
26 Publications
1994 | Journal Article | IST-REx-ID: 4033
Chazelle, B., Edelsbrunner, H., Guibas, L., Hershberger, J., Seidel, R., & Sharir, M. (1994). Selecting heavily covered points. SIAM Journal on Computing. SIAM. https://doi.org/10.1137/S0097539790179919
View
| DOI
| Download None (ext.)
1993 | Journal Article | IST-REx-ID: 4041
Edelsbrunner, H., Seidel, R., & Sharir, M. (1993). On the zone theorem for hyperplane arrangements. SIAM Journal on Computing. SIAM. https://doi.org/10.1137/0222031
View
| DOI
| Download None (ext.)
1993 | Journal Article | IST-REx-ID: 4036
Chazelle, B., Edelsbrunner, H., Guibas, L., Sharir, M., & Snoeyink, J. (1993). Computing a face in an arrangement of line segments and related problems. SIAM Journal on Computing. SIAM. https://doi.org/10.1137/0222077
View
| DOI
| Download None (ext.)
1993 | Journal Article | IST-REx-ID: 4042
Edelsbrunner, H., & Tan, T. (1993). A quadratic time algorithm for the minmax length triangulation. SIAM Journal on Computing. SIAM. https://doi.org/10.1137/0222036
View
| DOI
| Download None (ext.)
1992 | Journal Article | IST-REx-ID: 4043
Edelsbrunner, H., Tan, T., & Waupotitsch, R. (1992). An O(n^2 log n) time algorithm for the MinMax angle triangulation. SIAM Journal on Scientific Computing. Society for Industrial and Applied Mathematics . https://doi.org/10.1137/0913058
View
| DOI
| Download None (ext.)