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.
25 Publications
1991 | Book Chapter | IST-REx-ID: 3566
H. Edelsbrunner and M. Sharir, “A hyperplane incidence problem with applications to counting distances,” in Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift, vol. 4, American Mathematical Society, 1991, pp. 253–263.
View
| Download None (ext.)
1991 | Book Chapter | IST-REx-ID: 3567
H. Edelsbrunner, “Lines in space – A collection of results,” in Discrete & Computational Geometry: Papers from the Dimacs Special Year, vol. 6, Springer, 1991, pp. 77–93.
View
| Download None (ext.)
1991 | Journal Article | IST-REx-ID: 4052 | 
B. Chazelle, H. Edelsbrunner, L. Guibas, and M. Sharir, “A singly exponential stratification scheme for real semi-algebraic varieties and its applications,” Theoretical Computer Science, vol. 84, no. 1. Elsevier, pp. 77–105, 1991.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1991 | Journal Article | IST-REx-ID: 4056 |
H. Edelsbrunner and P. Hajnal, “A lower bound on the number of unit distances between the vertices of a convex polygon,” Journal of Combinatorial Theory Series A, vol. 56, no. 2. Elsevier, pp. 312–316, 1991.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1991 | Conference Paper | IST-REx-ID: 4054
H. Edelsbrunner, R. Seidel, and M. Sharir, “On the zone theorem for hyperplane arrangements,” presented at the New Results and New Trends in Computer Science , 1991, vol. 555, pp. 108–123.
View
| DOI
| Download None (ext.)
1991 | Conference Paper | IST-REx-ID: 4058
B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, and J. Snoeyink, “Computing a face in an arrangement of line segments,” in Proceedings of the 2nd annual ACM-SIAM symposium on Discrete algorithms, San Francisco, CA, United States of America, 1991, pp. 441–448.
View
| Download None (ext.)
1991 | Conference Paper | IST-REx-ID: 4055
H. Edelsbrunner and T. Tan, “A quadratic time algorithm for the minmax length triangulation,” in 32nd Annual Symposium of Foundations of Computer Science, San Juan, PR, United States of America, 1991, pp. 414–423.
View
| DOI
| Download None (ext.)
1991 | Journal Article | IST-REx-ID: 4051
H. Edelsbrunner and W. Shi, “An O(n log^2 h) time algorithm for the three-dimensional convex hull problem,” SIAM Journal on Computing, vol. 20, no. 2. SIAM, pp. 259–269, 1991.
View
| DOI
| Download None (ext.)
1991 | Journal Article | IST-REx-ID: 4057 |
H. Edelsbrunner, “Corrigendum,” Journal of Computer and System Sciences, vol. 42, no. 2. Elsevier, pp. 249–251, 1991.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1991 | Journal Article | IST-REx-ID: 3468
P. M. Jonas, D. Koh, K. Kampe, M. Hermsteiner, and W. Vogel, “ATP-sensitive and Ca-activated K channels in vertebrate axons: novel links between metabolism and excitability,” Pflügers Archiv : European Journal of Physiology, vol. 418, no. 1–2. Springer, pp. 68–73, 1991.
View
| DOI
| Download None (ext.)
| PubMed | Europe PMC