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.
1608 Publications
1989 | Journal Article | IST-REx-ID: 4088 | 
Edelsbrunner, Herbert, Leonidas Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, and Emo Welzl. “Implicitly Representing Arrangements of Lines or Segments.” Discrete & Computational Geometry. Springer, 1989. https://doi.org/10.1007/BF02187742.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1989 | Journal Article | IST-REx-ID: 4083 |
Yao, F., David Dobkin, Herbert Edelsbrunner, and Michael Paterson. “Partitioning Space for Range Queries.” SIAM Journal on Computing. SIAM, 1989. https://doi.org/10.1137/0218025.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1989 | Journal Article | IST-REx-ID: 4084 |
Edelsbrunner, Herbert, Günter Rote, and Emo Welzl. “Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane.” Theoretical Computer Science. Elsevier, 1989. https://doi.org/10.1016/0304-3975(89)90133-3.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1989 | Conference Paper | IST-REx-ID: 4087
Edelsbrunner, Herbert, Franco Preparata, and Douglas West. “Tetrahedrizing Point Sets in Three Dimensions.” In International Symposium on Symbolic and Algebraic Computation, 358:315–31. Springer, 1989. https://doi.org/10.1007/3-540-51084-2_31.
View
| DOI
| Download None (ext.)
1988 | Conference Paper | IST-REx-ID: 4097
Edelsbrunner, Herbert, Leonidas Guibas, János Pach, Richard Pollack, Raimund Seidel, and Micha Sharir. “Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms.” In 15th International Colloquium on Automata, Languages and Programming, 317:214–29. Springer, 1988. https://doi.org/10.1007/3-540-19488-6_118.
View
| DOI
| Download None (ext.)
1988 | Conference Paper | IST-REx-ID: 4096
Edelsbrunner, Herbert. “Geometric Structures in Computational Geometry.” In 15th International Colloquium on Automata, Languages and Programming, 317:201–13. Springer, 1988. https://doi.org/10.1007/3-540-19488-6_117.
View
| DOI
| Download None (ext.)
1987 | Journal Article | IST-REx-ID: 4100
Chazelle, Bernard, and Herbert Edelsbrunner. “Linear Space Data Structures for Two Types of Range Search.” Discrete & Computational Geometry. Springer, 1987. https://doi.org/10.1007/BF02187875.
View
| DOI
1987 | Book | IST-REx-ID: 3900
Edelsbrunner, Herbert. Algorithms in Combinatorial Geometry. Vol. 10. Berlin ; Heidelberg: Springer, 1987. https://doi.org/10.1007/978-3-642-61568-9.
View
| Files available
| DOI
1986 | Journal Article | IST-REx-ID: 3580
Edelsbrunner, Herbert. “Edge-Skeletons in Arrangements with Applications.” Algorithmica. Springer, 1986. https://doi.org/10.1007/BF01840438.
View
| DOI
1986 | Journal Article | IST-REx-ID: 4098 |
Edelsbrunner, Herbert, and Gerd Stöckl. “The Number of Extreme Pairs of Finite Point-Sets in Euclidean Spaces.” Journal of Combinatorial Theory Series A. Elsevier, 1986. https://doi.org/10.1016/0097-3165(86)90075-0.
View
| DOI
| Download None (ext.)