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.
1605 Publications
1990 | Journal Article | IST-REx-ID: 4072
Edelsbrunner H, Guibas L, Sharir M. The complexity and construction of many faces in arrangements of lines and of segments. Discrete & Computational Geometry. 1990;5(1):161-196. doi:10.1007/BF02187784
View
| DOI
| Download None (ext.)
1990 | Journal Article | IST-REx-ID: 4065
Edelsbrunner H, Robison A, Shen X. Covering convex sets with non-overlapping polygons. Discrete Mathematics. 1990;81(2):153-164. doi:10.1016/0012-365X(90)90147-A
View
| DOI
| Download None (ext.)
1990 | Journal Article | IST-REx-ID: 4074
Clarkson K, Edelsbrunner H, Guibas L, Sharir M, Welzl E. Combinatorial complexity bounds for arrangements of curves and spheres. Discrete & Computational Geometry. 1990;5(1):99-160. doi:10.1007/BF02187783
View
| DOI
| Download None (ext.)
1990 | Conference Paper | IST-REx-ID: 4076
Agarwal P, Edelsbrunner H, Schwarzkopf O, Welzl E. Euclidean minimum spanning trees and bichromatic closest pairs. In: Proceedings of the 6th Annual Symposium on Computational Geometry. ACM; 1990:203-210. doi:10.1145/98524.98567
View
| DOI
| Download None (ext.)
1990 | Conference Paper | IST-REx-ID: 4077
Aronov B, Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Wenger R. Points and triangles in the plane and halving planes in space. In: Proceedings of the 6th Annual Symposium on Computational Geometry. ACM; 1990:112-115. doi:10.1145/98524.98548
View
| DOI
| Download None (ext.)
1990 | Journal Article | IST-REx-ID: 4075
Dobkin D, Edelsbrunner H, Overmars M. Searching for empty convex polygons. Algorithmica. 1990;5(4):561-571. doi:10.1007/BF01840404
View
| DOI
| Download None (ext.)
1990 | Book Chapter | IST-REx-ID: 4311
Barton NH, Clark A. Population structure and processes in evolution. In: Wöhrmann K, Jain S, eds. Population Biology: Ecological and Evolutionary Viewpoints. Springer; 1990:115-174. doi:10.1007/978-3-642-74474-7_5
View
| DOI
| Download None (ext.)
1989 | Journal Article | IST-REx-ID: 4088 | 
Edelsbrunner H, Guibas L, Hershberger J, et al. Implicitly representing arrangements of lines or segments. Discrete & Computational Geometry. 1989;4(1):433-466. doi:10.1007/BF02187742
[Published Version]
View
| DOI
| Download Published Version (ext.)
1989 | Journal Article | IST-REx-ID: 4083 |
Yao F, Dobkin D, Edelsbrunner H, Paterson M. Partitioning space for range queries. SIAM Journal on Computing. 1989;18(2):371-384. doi:10.1137/0218025
[Published Version]
View
| DOI
| Download Published Version (ext.)
1989 | Journal Article | IST-REx-ID: 4084 |
Edelsbrunner H, Rote G, Welzl E. Testing the necklace condition for shortest tours and optimal factors in the plane. Theoretical Computer Science. 1989;66(2):157-180. doi:10.1016/0304-3975(89)90133-3
[Published Version]
View
| DOI
| Download Published Version (ext.)
1989 | Conference Paper | IST-REx-ID: 4087
Edelsbrunner H, Preparata F, West D. Tetrahedrizing point sets in three dimensions. In: International Symposium on Symbolic and Algebraic Computation. Vol 358. Springer; 1989:315-331. doi:10.1007/3-540-51084-2_31
View
| DOI
| Download None (ext.)
1988 | Conference Paper | IST-REx-ID: 4097
Edelsbrunner H, Guibas L, Pach J, Pollack R, Seidel R, Sharir M. Arrangements of curves in the plane - topology, combinatorics, and algorithms. In: 15th International Colloquium on Automata, Languages and Programming. Vol 317. Springer; 1988:214-229. doi:10.1007/3-540-19488-6_118
View
| DOI
| Download None (ext.)
1988 | Conference Paper | IST-REx-ID: 4096
Edelsbrunner H. Geometric structures in computational geometry. In: 15th International Colloquium on Automata, Languages and Programming. Vol 317. Springer; 1988:201-213. doi:10.1007/3-540-19488-6_117
View
| DOI
| Download None (ext.)
1987 | Journal Article | IST-REx-ID: 4100
Chazelle B, Edelsbrunner H. Linear space data structures for two types of range search. Discrete & Computational Geometry. 1987;2(1):113-126. doi:10.1007/BF02187875
View
| DOI
1987 | Book | IST-REx-ID: 3900
Edelsbrunner H. Algorithms in Combinatorial Geometry. Vol 10. Berlin ; Heidelberg: Springer; 1987. doi:10.1007/978-3-642-61568-9
View
| Files available
| DOI
1986 | Journal Article | IST-REx-ID: 3580
Edelsbrunner H. Edge-skeletons in arrangements with applications. Algorithmica. 1986;1(1-4):93-109. doi:10.1007/BF01840438
View
| DOI
1986 | Journal Article | IST-REx-ID: 4098 |
Edelsbrunner H, Stöckl G. The number of extreme pairs of finite point-sets in Euclidean spaces. Journal of Combinatorial Theory Series A. 1986;43(2):344-349. doi:10.1016/0097-3165(86)90075-0
View
| DOI
| Download None (ext.)
1986 | Journal Article | IST-REx-ID: 4107
Edelsbrunner H, Haussler D. The complexity of cells in 3-dimensional arrangements. Discrete Mathematics. 1986;60(C):139-146. doi:10.1016/0012-365X(86)90008-7
View
| DOI
1985 | Journal Article | IST-REx-ID: 4111
Edelsbrunner H, Maurer H. Finding extreme-points in 3-dimensions and solving the post-office problem in the plane. Information Processing Letters. 1985;21(1):39-47. doi:10.1016/0020-0190(85)90107-3
View
| DOI
1984 | Journal Article | IST-REx-ID: 4121
Day W, Edelsbrunner H. Efficient algorithms for agglomerative hierarchical clustering methods. Journal of Classification. 1984;1:7-24. doi:10.1007/BF01890115
View
| DOI
| Download None (ext.)