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.
32 Publications
1991 | Journal Article | IST-REx-ID: 4062 |
Aronov, B., Chazelle, B., Edelsbrunner, H., Guibas, L., Sharir, M., & Wenger, R. (1991). Points and triangles in the plane and halving planes in space. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/BF02574700
[Published Version]
View
| DOI
| Download Published Version (ext.)
1990 | Journal Article | IST-REx-ID: 4066
Edelsbrunner, H., Guibas, L., & Sharir, M. (1990). The complexity of many cells in arrangements of planes and related problems. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/BF02187785
View
| DOI
| Download None (ext.)
1990 | Journal Article | IST-REx-ID: 4072
Edelsbrunner, H., Guibas, L., & Sharir, M. (1990). The complexity and construction of many faces in arrangements of lines and of segments. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/BF02187784
View
| DOI
| Download None (ext.)
1990 | Journal Article | IST-REx-ID: 4068
Edelsbrunner, H., & Sharir, M. (1990). The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/BF02187778
View
| DOI
| Download None (ext.)
1990 | Journal Article | IST-REx-ID: 4074
Clarkson, K., Edelsbrunner, H., Guibas, L., Sharir, M., & Welzl, E. (1990). Combinatorial complexity bounds for arrangements of curves and spheres. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/BF02187783
View
| DOI
| Download None (ext.)