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.
31 Publications
1990 | Journal Article | IST-REx-ID: 4065
Edelsbrunner, Herbert, et al. “Covering Convex Sets with Non-Overlapping Polygons.” Discrete Mathematics, vol. 81, no. 2, Elsevier, 1990, pp. 153–64, doi:10.1016/0012-365X(90)90147-A.
View
| DOI
| Download None (ext.)
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
| Download None (ext.)
1990 | Conference Paper | IST-REx-ID: 4078
Chazelle, Bernard, et al. “Slimming down by Adding; Selecting Heavily Covered Points.” Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 116–27, doi:10.1145/98524.98551.
View
| DOI
| Download None (ext.)
1990 | Conference Paper | IST-REx-ID: 4076
Agarwal, Pankaj, et al. “ Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.” Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 203–10, doi:10.1145/98524.98567.
View
| DOI
| Download None (ext.)
1990 | Conference Paper | IST-REx-ID: 4077
Aronov, Boris, et al. “Points and Triangles in the Plane and Halving Planes in Space.” Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 112–15, doi:10.1145/98524.98548.
View
| DOI
| Download None (ext.)