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
1990 | Conference Paper | IST-REx-ID: 4067
Edelsbrunner H, Sharir M. A hyperplane Incidence problem with applications to counting distances. In: Proceedings of the International Symposium on Algorithms. Vol 450. Springer; 1990:419-428. doi:10.1007/3-540-52921-7_91
View
| DOI
| Download None (ext.)
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
| Download None (ext.)
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
| Download None (ext.)
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.)