Please note that IST 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.

5295 Publications


1989 | Conference Paper | IST-REx-ID: 3549
Edelsbrunner, Herbert. “Spatial Triangulations with Dihedral Angle Conditions,” 83–89. Institute of the Electronics, Information and Communication Enginneers, 1989.
View
 

1989 | Journal Article | IST-REx-ID: 4080
Edelsbrunner, Herbert, Nany Hasan, Raimund Seidel, and Xiao Shen. “Circles through Two Points That Always Enclose Many Points.” Geometriae Dedicata 32, no. 1 (1989): 1–12. https://doi.org/10.1007/BF00181432.
View | DOI
 

1989 | Conference Paper | IST-REx-ID: 4085
Edelsbrunner, Herbert. “An Acyclicity Theorem for Cell Complexes in d Dimension,” 145–51. ACM, 1989. https://doi.org/10.1145/73833.73850.
View | DOI
 

1989 | Conference Paper | IST-REx-ID: 4092
Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, and Micha Sharir. “A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications,” 372:179–93. Springer, 1989. https://doi.org/10.1007/BFb0035760.
View | DOI
 

1989 | Journal Article | IST-REx-ID: 4314
Barton, Nicholas H. “The Divergence of a Polygenic System under Stabilising Selection, Mutation and Drift.” Genetical Research 54, no. 1 (1989): 59–77. https://doi.org/10.1017/S0016672300028378.
View | DOI
 

1989 | Journal Article | IST-REx-ID: 3653
Mallet, James, and Nicholas H Barton. “Strong Natural Selection in a Warning Color Hybrid Zone.” Evolution 43 (1989): 421–31. https://doi.org/10.2307/2409217 .
View | DOI
 

1989 | Journal Article | IST-REx-ID: 4079
Edelsbrunner, Herbert, and Steven Skiena. “On the Number of Furthest Neighbor Pairs in a Point Set.” American Mathematical Monthly 96, no. 7 (1989): 614–18.
View | Download (ext.)
 

1989 | Journal Article | IST-REx-ID: 4081
Edelsbrunner, Herbert, Leonidas Guibas, and Micha Sharir. “The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications.” Discrete & Computational Geometry 4, no. 1 (1989): 311–36. https://doi.org/10.1007/BF02187733.
View | DOI
 

1989 | Journal Article | IST-REx-ID: 4086
Edelsbrunner, Herbert. “The Upper Envelope of Piecewise Linear Functions: Tight Bounds on the Number of Faces .” Discrete & Computational Geometry 4, no. 4 (1989): 337–43. https://doi.org/10.1007/BF02187734.
View | DOI
 

1989 | Journal Article | IST-REx-ID: 4093
Chazelle, Bernard, Herbert Edelsbrunner, and Leonidas Guibas. “The Complexity of Cutting Complexes.” Discrete & Computational Geometry 4, no. 1 (1989): 139–81. https://doi.org/10.1007/BF02187720.
View | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed