Please note that IST 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.

6420 Publications


1991 | Conference Paper | IST-REx-ID: 4621
Alur R, Feder T, Henzinger TA. The benefits of relaxing punctuality. In: ACM; 1991:139-152.
View
 

1991 | Journal Article | IST-REx-ID: 4051
Edelsbrunner H, Shi W. An O(n log^2 h) time algorithm for the three-dimensional convex hull problem. SIAM Journal on Computing. 1991;20(2):259-269. doi:10.1137/0220016
View | DOI
 

1991 | Journal Article | IST-REx-ID: 4052
Chazelle B, Edelsbrunner H, Guibas L, Sharir M. A singly exponential stratification scheme for real semi-algebraic varieties and its applications. Theoretical Computer Science. 1991;84(1):77-105. doi:10.1016/0304-3975(91)90261-Y
View | DOI
 

1991 | Conference Paper | IST-REx-ID: 4054
Edelsbrunner H, Seidel R, Sharir M. On the zone theorem for hyperplane arrangements. In: Vol 555. Springer; 1991:108-123. doi:10.1007/BFb0038185
View | DOI
 

1991 | Conference Paper | IST-REx-ID: 4055
Edelsbrunner H, Tan T. A quadratic time algorithm for the minmax length triangulation. In: IEEE; 1991:414-423. doi:10.1109/SFCS.1991.185400
View | DOI
 

1991 | Journal Article | IST-REx-ID: 4056
Edelsbrunner H, Hajnal P. A lower bound on the number of unit distances between the vertices of a convex polygon. Journal of Combinatorial Theory Series A. 1991;56(2):312-316. doi:10.1016/0097-3165(91)90042-F
View | DOI
 

1991 | Journal Article | IST-REx-ID: 4057
Edelsbrunner H. Corrigendum. Journal of Computer and System Sciences. 1991;42(2):249-251. doi:10.1016/0022-0000(91)90013-U
View | DOI
 

1991 | Conference Paper | IST-REx-ID: 4058
Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Snoeyink J. Computing a face in an arrangement of line segments. In: SIAM; 1991:441-448.
View
 

1991 | Conference Paper | IST-REx-ID: 4059
Chazelle B, Edelsbrunner H, Grigni M, et al. Ray shooting in polygons using geodesic triangulations. In: Vol 510. Springer; 1991:661-673. doi:10.1007/3-540-54233-7_172
View | DOI
 

1991 | Journal Article | IST-REx-ID: 4061
Agarwal P, Edelsbrunner H, Schwarzkopf O, Welzl E. Euclidean minimum spanning trees and bichromatic closest pairs. Discrete & Computational Geometry. 1991;6(1):407-422. doi:10.1007/BF02574698
View | DOI
 

Search

Filter Publications