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.
6952 Publications
1987 | Journal Article | IST-REx-ID: 4095
Chazelle, B., & Edelsbrunner, H. (1987). An improved algorithm for constructing kth-order Voronoi diagrams. IEEE Transactions on Computers. IEEE. https://doi.org/10.1109/TC.1987.5009474
View
| DOI
| Download None (ext.)
1987 | Journal Article | IST-REx-ID: 4094
Edelsbrunner, H., & Shen, X. (1987). A tight lower bound on the size of visibility graphs. Information Processing Letters. Elsevier. https://doi.org/10.1016/0020-0190(87)90038-X
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: 4103 | 
Edelsbrunner, H., & Welzl, E. (1986). On the maximal number of edges of many faces in an arrangement. Journal of Combinatorial Theory Series A. Elsevier. https://doi.org/10.1016/0097-3165(86)90078-6
[Published Version]
View
| DOI
| Download Published Version (ext.)