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
1991 | Journal Article | IST-REx-ID: 4051
Edelsbrunner, H., & Shi, W. (1991). An O(n log^2 h) time algorithm for the three-dimensional convex hull problem. SIAM Journal on Computing. SIAM. https://doi.org/10.1137/0220016
View
| DOI
| Download None (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.)
1988 | Journal Article | IST-REx-ID: 4091
Edelsbrunner, H., & Skiena, S. (1988). Probing convex polygons with X-Rays. SIAM Journal on Computing. SIAM. https://doi.org/10.1137/0217054
View
| DOI
| Download None (ext.)
1986 | Journal Article | IST-REx-ID: 4105
Edelsbrunner, H., O’Rourke, J., & Seidel, R. (1986). Constructing arrangements of lines and hyperplanes with applications. SIAM Journal on Computing. SIAM. https://doi.org/10.1137/0215024
View
| DOI
1986 | Journal Article | IST-REx-ID: 4104
Edelsbrunner, H., Guibas, L., & Stolfi, J. (1986). Optimal point location in a monotone subdivision. SIAM Journal on Computing. SIAM. https://doi.org/10.1137/0215023
View
| DOI
1986 | Journal Article | IST-REx-ID: 4110
Edelsbrunner, H., & Welzl, E. (1986). Constructing belts in two-dimensional arrangements with applications. SIAM Journal on Computing. SIAM. https://doi.org/10.1137/0215019
View
| DOI