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
1989 | Journal Article | IST-REx-ID: 4088 | 
Edelsbrunner, H., Guibas, L., Hershberger, J., Seidel, R., Sharir, M., Snoeyink, J., & Welzl, E. (1989). Implicitly representing arrangements of lines or segments. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/BF02187742
[Published Version]
View
| DOI
| Download Published Version (ext.)
1989 | Journal Article | IST-REx-ID: 4089 |
Edelsbrunner, H., Guibas, L., Hershberger, J., Pach, J., Pollack, R., Seidel, R., … Snoeyink, J. (1989). On arrangements of Jordan arcs with three intersections per pair. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/BF02187745
[Published Version]
View
| DOI
| Download Published Version (ext.)
1989 | Journal Article | IST-REx-ID: 4086 |
Edelsbrunner, H. (1989). The upper envelope of piecewise linear functions: Tight bounds on the number of faces . Discrete & Computational Geometry. Springer. https://doi.org/10.1007/BF02187734
[Published Version]
View
| DOI
| Download Published Version (ext.)
1989 | Journal Article | IST-REx-ID: 4081 |
Edelsbrunner, H., Guibas, L., & Sharir, M. (1989). The upper envelope of piecewise linear functions: Algorithms and applications. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/BF02187733
[Published Version]
View
| DOI
| Download Published Version (ext.)
1989 | Journal Article | IST-REx-ID: 4093
Chazelle, B., Edelsbrunner, H., & Guibas, L. (1989). The complexity of cutting complexes. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/BF02187720
View
| DOI
| Download None (ext.)