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
Edelsbrunner, Herbert, and Micha Sharir. “A Hyperplane Incidence Problem with Applications to Counting Distances.” Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift, vol. 4, American Mathematical Society, 1991, pp. 253–63.
View
| Download None (ext.)
1991 | Book Chapter | IST-REx-ID: 3567
Edelsbrunner, Herbert. “Lines in Space – A Collection of Results.” 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 | 
Chazelle, Bernard, et al. “A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications.” Theoretical Computer Science, vol. 84, no. 1, Elsevier, 1991, pp. 77–105, doi:10.1016/0304-3975(91)90261-Y.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1991 | Journal Article | IST-REx-ID: 4056 |
Edelsbrunner, Herbert, and Péter 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, 1991, pp. 312–16, doi:10.1016/0097-3165(91)90042-F.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1991 | Conference Paper | IST-REx-ID: 4054
Edelsbrunner, Herbert, et al. On the Zone Theorem for Hyperplane Arrangements. Vol. 555, Springer, 1991, pp. 108–23, doi:10.1007/BFb0038185.
View
| DOI
| Download None (ext.)
1991 | Conference Paper | IST-REx-ID: 4058
Chazelle, Bernard, et al. “Computing a Face in an Arrangement of Line Segments.” Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 1991, pp. 441–48.
View
| Download None (ext.)
1991 | Conference Paper | IST-REx-ID: 4055
Edelsbrunner, Herbert, and Tiow Tan. “A Quadratic Time Algorithm for the Minmax Length Triangulation.” 32nd Annual Symposium of Foundations of Computer Science, IEEE, 1991, pp. 414–23, doi:10.1109/SFCS.1991.185400.
View
| DOI
| Download None (ext.)
1991 | Journal Article | IST-REx-ID: 4051
Edelsbrunner, Herbert, and Weiping 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, 1991, pp. 259–69, doi:10.1137/0220016 .
View
| DOI
| Download None (ext.)
1991 | Journal Article | IST-REx-ID: 4057 |
Edelsbrunner, Herbert. “Corrigendum.” Journal of Computer and System Sciences, vol. 42, no. 2, Elsevier, 1991, pp. 249–51, doi:10.1016/0022-0000(91)90013-U.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1991 | Journal Article | IST-REx-ID: 3468
Jonas, Peter M., et al. “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, 1991, pp. 68–73, doi:10.1007/BF00370453.
View
| DOI
| Download None (ext.)
| PubMed | Europe PMC