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.

31 Publications


1990 | Journal Article | IST-REx-ID: 4063
Edelsbrunner H, Mücke E. Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms. ACM Transactions on Graphics. 1990;9(1):66-104. doi:10.1145/77635.77639
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4064
Edelsbrunner H, Souvaine D. Computing least median of squares regression lines and guided topological sweep. Journal of the American Statistical Association. 1990;85(409):115-119. doi:10.1080/01621459.1990.10475313
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4065
Edelsbrunner H, Robison A, Shen X. Covering convex sets with non-overlapping polygons. Discrete Mathematics. 1990;81(2):153-164. doi:10.1016/0012-365X(90)90147-A
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4066
Edelsbrunner H, Guibas L, Sharir M. The complexity of many cells in arrangements of planes and related problems. Discrete & Computational Geometry. 1990;5(1):197-216. doi:10.1007/BF02187785
View | DOI
 

1990 | Conference Paper | IST-REx-ID: 4067
Edelsbrunner H, Sharir M. A hyperplane Incidence problem with applications to counting distances. In: Vol 450. Springer; 1990:419-428. doi:10.1007/3-540-52921-7_91
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4068
Edelsbrunner H, Sharir M. The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2. Discrete & Computational Geometry. 1990;5(1):35-42. doi: 10.1007/BF02187778
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4069
Edelsbrunner H. An acyclicity theorem for cell complexes in d dimension. Combinatorica. 1990;10(3):251-260. doi:10.1007/BF02122779
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4070
Edelsbrunner H, Overmars M, Welzl E, Hartman I, Feldman J. Ranking intervals under visibility constraints. International Journal of Computer Mathematics. 1990;34(3-4):129-144. doi:10.1080/00207169008803871
View | DOI
 

1990 | Conference Paper | IST-REx-ID: 4071
Edelsbrunner H, Tan T, Waupotitsch R. An O(n^2log n) time algorithm for the MinMax angle triangulation. In: ACM; 1990:44-52. doi:10.1145/98524.98535
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4072
Edelsbrunner H, Guibas L, Sharir M. The complexity and construction of many faces in arrangements of lines and of segments. Discrete & Computational Geometry. 1990;5(1):161-196. doi: 10.1007/BF02187784
View | DOI
 

Filters and Search Terms

year=1990

Search

Filter Publications