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.
31 Publications
1990 | Conference Paper | IST-REx-ID: 4073
Chazelle B, Edelsbrunner H, Guibas L, et al. Counting and cutting cycles of lines and rods in space. In: 31st Annual Symposium on Foundations of Computer Science. IEEE; 1990:242-251. doi:10.1109/FSCS.1990.89543
View
| DOI
| Download None (ext.)
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
| Download None (ext.)
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: Proceedings of the 6th Annual Symposium on Computational Geometry. ACM; 1990:44-52. doi:10.1145/98524.98535
View
| DOI
| Download None (ext.)
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
| Download None (ext.)
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
| Download None (ext.)