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.

6016 Publications


1990 | Journal Article | IST-REx-ID: 4063
Edelsbrunner, Herbert, and Ernst Mücke. “Simulation of Simplicity: A Technique to Cope with Degenerate Cases in Geometric Algorithms.” ACM Transactions on Graphics 9, no. 1 (1990): 66–104. https://doi.org/10.1145/77635.77639.
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4064
Edelsbrunner, Herbert, and Diane Souvaine. “Computing Least Median of Squares Regression Lines and Guided Topological Sweep.” Journal of the American Statistical Association 85, no. 409 (1990): 115–19. https://doi.org/10.1080/01621459.1990.10475313.
View | DOI
 

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

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 5, no. 1 (1990): 197–216. https://doi.org/10.1007/BF02187785.
View | DOI
 

1990 | Conference Paper | IST-REx-ID: 4067
Edelsbrunner, Herbert, and Micha Sharir. “A Hyperplane Incidence Problem with Applications to Counting Distances,” 450:419–28. Springer, 1990. https://doi.org/10.1007/3-540-52921-7_91.
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4068
Edelsbrunner, Herbert, and Micha Sharir. “The Maximum Number of Ways to Stabn Convex Nonintersecting Sets in the Plane Is 2n−2.” Discrete & Computational Geometry 5, no. 1 (1990): 35–42. https://doi.org/ 10.1007/BF02187778.
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4069
Edelsbrunner, Herbert. “An Acyclicity Theorem for Cell Complexes in d Dimension.” Combinatorica 10, no. 3 (1990): 251–60. https://doi.org/10.1007/BF02122779.
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4070
Edelsbrunner, Herbert, Mark Overmars, Emo Welzl, Irith Hartman, and Jack Feldman. “Ranking Intervals under Visibility Constraints.” International Journal of Computer Mathematics 34, no. 3–4 (1990): 129–44. https://doi.org/10.1080/00207169008803871.
View | DOI
 

1990 | Conference Paper | IST-REx-ID: 4071
Edelsbrunner, Herbert, Tiow Tan, and Roman Waupotitsch. “An O(N^2log n) Time Algorithm for the MinMax Angle Triangulation,” 44–52. ACM, 1990. https://doi.org/10.1145/98524.98535.
View | DOI
 

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 5, no. 1 (1990): 161–96. https://doi.org/ 10.1007/BF02187784.
View | DOI
 

1990 | Conference Paper | IST-REx-ID: 4073
Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, and Jack Snoeyink. “Counting and Cutting Cycles of Lines and Rods in Space,” 242–51. IEEE, 1990. https://doi.org/10.1109/FSCS.1990.89543.
View | DOI
 

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 5, no. 1 (1990): 99–160. https://doi.org/10.1007/BF02187783.
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4075
Dobkin, David, Herbert Edelsbrunner, and Mark Overmars. “Searching for Empty Convex Polygons.” Algorithmica 5, no. 4 (1990): 561–71. https://doi.org/10.1007/BF01840404.
View | DOI
 

1990 | Conference Paper | IST-REx-ID: 4076
Agarwal, Pankaj, Herbert Edelsbrunner, Otfried Schwarzkopf, and Emo Welzl. “ Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs,” 203–10. ACM, 1990. https://doi.org/10.1145/98524.98567.
View | DOI
 

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,” 112–15. ACM, 1990. https://doi.org/10.1145/98524.98548.
View | DOI
 

1990 | Conference Paper | IST-REx-ID: 4078
Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, John Hershberger, Raimund Seidel, and Micha Sharir. “Slimming down by Adding; Selecting Heavily Covered Points,” 116–27. ACM, 1990. https://doi.org/10.1145/98524.98551.
View | DOI
 

1990 | Book Review | IST-REx-ID: 4310
Barton, Nicholas H, and Steve Jones. “The Language of the Genes.” Nature. Nature Publishing Group, 1990. https://doi.org/10.1038/346415a0.
View | DOI
 

1990 | Book Chapter | IST-REx-ID: 4311
Barton, Nicholas H, and A. Clark. “Population Structure.” In Population Biology: Ecological and Evolutionary Viewpoints, edited by Klaus Wöhrmann and Subodh Jain, 115–74. Springer, 1990.
View
 

1990 | Conference Paper | IST-REx-ID: 4510
Henzinger, Thomas A, Zohar Manna, and Amir Pnueli. “An Interleaving Model for Real Time,” 717–30. IEEE, 1990.
View | Download (ext.)
 

1990 | Conference Paper | IST-REx-ID: 4522
Henzinger, Thomas A. “Half-Order Modal Logic: How to Prove Real-Time Properties,” 281–96. ACM, 1990. https://doi.org/10.1145/93385.93429.
View | DOI | Download (ext.)
 

Search

Filter Publications