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. 23(6), 1138–1151.
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. 22(2), 418–429.
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. 22(6), 1286–1302.
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. 22(3), 527–551.
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. 13(4), 994–1008.
View
| DOI
| Download None (ext.)
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. 20(2), 259–269.
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. 18(2), 371–384.
[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. 17(5), 870–882.
View
| DOI
| Download None (ext.)