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.

5761 Publications


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
 

Search

Filter Publications