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.

31 Publications


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, vol. 5, no. 1, Springer, 1990, pp. 35–42, doi: 10.1007/BF02187778.
View | DOI
 

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

1990 | Journal Article | IST-REx-ID: 4070
Edelsbrunner, Herbert, et al. “Ranking Intervals under Visibility Constraints.” International Journal of Computer Mathematics, vol. 34, no. 3–4, Taylor & Francis, 1990, pp. 129–44, doi:10.1080/00207169008803871.
View | DOI
 

1990 | Conference Paper | IST-REx-ID: 4071
Edelsbrunner, Herbert, et al. An O(N^2log n) Time Algorithm for the MinMax Angle Triangulation. ACM, 1990, pp. 44–52, doi:10.1145/98524.98535.
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4072
Edelsbrunner, Herbert, et al. “The Complexity and Construction of Many Faces in Arrangements of Lines and of Segments.” Discrete & Computational Geometry, vol. 5, no. 1, Springer, 1990, pp. 161–96, doi: 10.1007/BF02187784.
View | DOI
 

1990 | Conference Paper | IST-REx-ID: 4073
Chazelle, Bernard, et al. Counting and Cutting Cycles of Lines and Rods in Space. IEEE, 1990, pp. 242–51, doi:10.1109/FSCS.1990.89543.
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4074
Clarkson, Kenneth, et al. “Combinatorial Complexity Bounds for Arrangements of Curves and Spheres.” Discrete & Computational Geometry, vol. 5, no. 1, Springer, 1990, pp. 99–160, doi:10.1007/BF02187783.
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4075
Dobkin, David, et al. “Searching for Empty Convex Polygons.” Algorithmica, vol. 5, no. 4, Springer, 1990, pp. 561–71, doi:10.1007/BF01840404.
View | DOI
 

1990 | Conference Paper | IST-REx-ID: 4076
Agarwal, Pankaj, et al. Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs. ACM, 1990, pp. 203–10, doi:10.1145/98524.98567.
View | DOI
 

1990 | Conference Paper | IST-REx-ID: 4077
Aronov, Boris, et al. Points and Triangles in the Plane and Halving Planes in Space. ACM, 1990, pp. 112–15, doi:10.1145/98524.98548.
View | DOI
 

1990 | Conference Paper | IST-REx-ID: 4078
Chazelle, Bernard, et al. Slimming down by Adding; Selecting Heavily Covered Points. ACM, 1990, pp. 116–27, doi:10.1145/98524.98551.
View | DOI
 

Filters and Search Terms

year=1990

Search

Filter Publications