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, Bernard, et al. “Selecting Heavily Covered Points.” SIAM Journal on Computing, vol. 23, no. 6, SIAM, 1994, pp. 1138–51, doi:10.1137/S0097539790179919 .
View
| DOI
| Download None (ext.)
1993 | Journal Article | IST-REx-ID: 4041
Edelsbrunner, Herbert, et al. “On the Zone Theorem for Hyperplane Arrangements.” SIAM Journal on Computing, vol. 22, no. 2, SIAM, 1993, pp. 418–29, doi:10.1137/0222031.
View
| DOI
| Download None (ext.)
1993 | Journal Article | IST-REx-ID: 4036
Chazelle, Bernard, et al. “Computing a Face in an Arrangement of Line Segments and Related Problems.” SIAM Journal on Computing, vol. 22, no. 6, SIAM, 1993, pp. 1286–302, doi:10.1137/0222077 .
View
| DOI
| Download None (ext.)
1993 | Journal Article | IST-REx-ID: 4042
Edelsbrunner, Herbert, and Tiow Tan. “A Quadratic Time Algorithm for the Minmax Length Triangulation.” SIAM Journal on Computing, vol. 22, no. 3, SIAM, 1993, pp. 527–51, doi:10.1137/0222036 .
View
| DOI
| Download None (ext.)
1992 | Journal Article | IST-REx-ID: 4043
Edelsbrunner, Herbert, et al. “An O(N^2 Log n) Time Algorithm for the MinMax Angle Triangulation.” SIAM Journal on Scientific Computing, vol. 13, no. 4, Society for Industrial and Applied Mathematics , 1992, pp. 994–1008, doi:10.1137/0913058.
View
| DOI
| Download None (ext.)
1991 | Journal Article | IST-REx-ID: 4051
Edelsbrunner, Herbert, and Weiping Shi. “An O(n Log^2 h) Time Algorithm for the Three-Dimensional Convex Hull Problem.” SIAM Journal on Computing, vol. 20, no. 2, SIAM, 1991, pp. 259–69, doi:10.1137/0220016 .
View
| DOI
| Download None (ext.)
1989 | Journal Article | IST-REx-ID: 4083 | 
Yao, F., et al. “Partitioning Space for Range Queries.” SIAM Journal on Computing, vol. 18, no. 2, SIAM, 1989, pp. 371–84, doi:10.1137/0218025.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1988 | Journal Article | IST-REx-ID: 4091
Edelsbrunner, Herbert, and Steven Skiena. “Probing Convex Polygons with X-Rays.” SIAM Journal on Computing, vol. 17, no. 5, SIAM, 1988, pp. 870–82, doi:10.1137/0217054 .
View
| DOI
| Download None (ext.)
1986 | Journal Article | IST-REx-ID: 4105
Edelsbrunner, Herbert, et al. “Constructing Arrangements of Lines and Hyperplanes with Applications.” SIAM Journal on Computing, vol. 15, no. 2, SIAM, 1986, pp. 341–63, doi:10.1137/0215024.
View
| DOI
1986 | Journal Article | IST-REx-ID: 4104
Edelsbrunner, Herbert, et al. “Optimal Point Location in a Monotone Subdivision.” SIAM Journal on Computing, vol. 15, no. 2, SIAM, 1986, pp. 317–40, doi:10.1137/0215023.
View
| DOI
1986 | Journal Article | IST-REx-ID: 4110
Edelsbrunner, Herbert, and Emo Welzl. “Constructing Belts in Two-Dimensional Arrangements with Applications.” SIAM Journal on Computing, vol. 15, no. 1, SIAM, 1986, pp. 271–84, doi:10.1137/0215019.
View
| DOI