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.

1838 Publications


1991 | Book Chapter | IST-REx-ID: 3566
Edelsbrunner, Herbert, and Micha Sharir. “A Hyperplane Incidence Problem with Applications to Counting Distances.” In Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift, 4:253–63. American Mathematical Society, 1991.
View | Download None (ext.)
 

1991 | Journal Article | IST-REx-ID: 4056 | OA
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. Elsevier, 1991. https://doi.org/10.1016/0097-3165(91)90042-F.
[Published Version] View | DOI | Download Published Version (ext.)
 

1991 | Conference Paper | IST-REx-ID: 4054
Edelsbrunner, Herbert, Raimund Seidel, and Micha Sharir. “On the Zone Theorem for Hyperplane Arrangements,” 555:108–23. Springer, 1991. https://doi.org/10.1007/BFb0038185.
View | DOI | Download None (ext.)
 

1991 | Conference Paper | IST-REx-ID: 4059
Chazelle, Bernard, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas Guibas, John Hershberger, Micha Sharir, and Jack Snoeyink. “Ray Shooting in Polygons Using Geodesic Triangulations.” In 18th International Colloquium on Automata, Languages and Programming, 510:661–73. Springer, 1991. https://doi.org/10.1007/3-540-54233-7_172.
View | DOI | Download None (ext.)
 

1991 | Journal Article | IST-REx-ID: 4061 | OA
Agarwal, Pankaj, Herbert Edelsbrunner, Otfried Schwarzkopf, and Emo Welzl. “Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.” Discrete & Computational Geometry. Springer, 1991. https://doi.org/10.1007/BF02574698.
[Published Version] View | DOI | Download Published Version (ext.)
 

1990 | Journal Article | IST-REx-ID: 3651 | OA
Barton, Nicholas H. “Pleiotropic Models of Quantitative Variation.” Genetics. Genetics Society of America, 1990. https://doi.org/10.1093/genetics/124.3.773 .
[Published Version] View | DOI | Download Published Version (ext.) | PubMed | Europe PMC
 

1990 | Conference Paper | IST-REx-ID: 4067
Edelsbrunner, Herbert, and Micha Sharir. “A Hyperplane Incidence Problem with Applications to Counting Distances.” In Proceedings of the International Symposium on Algorithms, 450:419–28. Springer, 1990. https://doi.org/10.1007/3-540-52921-7_91.
View | DOI | Download None (ext.)
 

1990 | Journal Article | IST-REx-ID: 4066
Edelsbrunner, Herbert, Leonidas Guibas, and Micha Sharir. “The Complexity of Many Cells in Arrangements of Planes and Related Problems.” Discrete & Computational Geometry. Springer, 1990. https://doi.org/10.1007/BF02187785.
View | DOI | Download None (ext.)
 

1990 | Journal Article | IST-REx-ID: 4072
Edelsbrunner, Herbert, Leonidas Guibas, and Micha Sharir. “The Complexity and Construction of Many Faces in Arrangements of Lines and of Segments.” Discrete & Computational Geometry. Springer, 1990. https://doi.org/10.1007/BF02187784.
View | DOI | Download None (ext.)
 

1990 | Journal Article | IST-REx-ID: 4065
Edelsbrunner, Herbert, Arch Robison, and Xiao Shen. “Covering Convex Sets with Non-Overlapping Polygons.” Discrete Mathematics. Elsevier, 1990. https://doi.org/10.1016/0012-365X(90)90147-A.
View | DOI | Download None (ext.)
 

1990 | Journal Article | IST-REx-ID: 4074
Clarkson, Kenneth, Herbert Edelsbrunner, Leonidas Guibas, Micha Sharir, and Emo Welzl. “Combinatorial Complexity Bounds for Arrangements of Curves and Spheres.” Discrete & Computational Geometry. Springer, 1990. https://doi.org/10.1007/BF02187783.
View | DOI | Download None (ext.)
 

1990 | Conference Paper | IST-REx-ID: 4076
Agarwal, Pankaj, Herbert Edelsbrunner, Otfried Schwarzkopf, and Emo Welzl. “ Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.” In Proceedings of the 6th Annual Symposium on Computational Geometry, 203–10. ACM, 1990. https://doi.org/10.1145/98524.98567.
View | DOI | Download None (ext.)
 

1990 | Conference Paper | IST-REx-ID: 4077
Aronov, Boris, Bernard Chazelle, Herbert Edelsbrunner, Leonidas Guibas, Micha Sharir, and Rephael Wenger. “Points and Triangles in the Plane and Halving Planes in Space.” In Proceedings of the 6th Annual Symposium on Computational Geometry, 112–15. ACM, 1990. https://doi.org/10.1145/98524.98548.
View | DOI | Download None (ext.)
 

1990 | Journal Article | IST-REx-ID: 4075
Dobkin, David, Herbert Edelsbrunner, and Mark Overmars. “Searching for Empty Convex Polygons.” Algorithmica. Springer, 1990. https://doi.org/10.1007/BF01840404.
View | DOI | Download None (ext.)
 

1990 | Book Chapter | IST-REx-ID: 4311
Barton, Nicholas H, and A. Clark. “Population Structure and Processes in Evolution.” In Population Biology: Ecological and Evolutionary Viewpoints, edited by Klaus Wöhrmann and Subodh Jain, 115–74. Springer, 1990. https://doi.org/10.1007/978-3-642-74474-7_5.
View | DOI | Download None (ext.)
 

1989 | Journal Article | IST-REx-ID: 4088 | OA
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 | OA
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 | OA
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.)
 

1989 | Journal Article | IST-REx-ID: 3465
Jonas, Peter M. “Temperature Dependence of Gating Current in Myelinated Nerve Fibers.” Journal of Membrane Biology. Springer, 1989. https://doi.org/10.1007/BF01870958.
View | DOI | Download None (ext.) | PubMed | Europe PMC
 

Filters and Search Terms

isbn%3D978-3-030-00150-6

Search

Filter Publications