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.
1837 Publications
1986 | Journal Article | IST-REx-ID: 4104
Optimal point location in a monotone subdivision
H. Edelsbrunner, L. Guibas, J. Stolfi, SIAM Journal on Computing 15 (1986) 317–340.
View
| DOI
H. Edelsbrunner, L. Guibas, J. Stolfi, SIAM Journal on Computing 15 (1986) 317–340.
1986 | Journal Article | IST-REx-ID: 4103 | 
On the maximal number of edges of many faces in an arrangement
H. Edelsbrunner, E. Welzl, Journal of Combinatorial Theory Series A 41 (1986) 159–166.
[Published Version]
View
| DOI
| Download Published Version (ext.)
H. Edelsbrunner, E. Welzl, Journal of Combinatorial Theory Series A 41 (1986) 159–166.
1986 | Journal Article | IST-REx-ID: 3580
Edge-skeletons in arrangements with applications
H. Edelsbrunner, Algorithmica 1 (1986) 93–109.
View
| DOI
H. Edelsbrunner, Algorithmica 1 (1986) 93–109.
1986 | Journal Article | IST-REx-ID: 4098 |
The number of extreme pairs of finite point-sets in Euclidean spaces
H. Edelsbrunner, G. Stöckl, Journal of Combinatorial Theory Series A 43 (1986) 344–349.
View
| DOI
| Download None (ext.)
H. Edelsbrunner, G. Stöckl, Journal of Combinatorial Theory Series A 43 (1986) 344–349.
1986 | Journal Article | IST-REx-ID: 4107
The complexity of cells in 3-dimensional arrangements
H. Edelsbrunner, D. Haussler, Discrete Mathematics 60 (1986) 139–146.
View
| DOI
H. Edelsbrunner, D. Haussler, Discrete Mathematics 60 (1986) 139–146.
1985 | Journal Article | IST-REx-ID: 4112
Batched dynamic solutions to decomposable searching problems
H. Edelsbrunner, M. Overmars, Journal of Algorithms 6 (1985) 515–542.
View
| DOI
H. Edelsbrunner, M. Overmars, Journal of Algorithms 6 (1985) 515–542.
1985 | Journal Article | IST-REx-ID: 4111
Finding extreme-points in 3-dimensions and solving the post-office problem in the plane
H. Edelsbrunner, H. Maurer, Information Processing Letters 21 (1985) 39–47.
View
| DOI
H. Edelsbrunner, H. Maurer, Information Processing Letters 21 (1985) 39–47.
1985 | Journal Article | IST-REx-ID: 4120 |
Optimal solutions for a class of point retrieval problems
B. Chazelle, H. Edelsbrunner, Journal of Symbolic Computation 1 (1985) 47–56.
[Published Version]
View
| DOI
| Download Published Version (ext.)
B. Chazelle, H. Edelsbrunner, Journal of Symbolic Computation 1 (1985) 47–56.
1984 | Journal Article | IST-REx-ID: 4121
Efficient algorithms for agglomerative hierarchical clustering methods
W. Day, H. Edelsbrunner, Journal of Classification 1 (1984) 7–24.
View
| DOI
| Download None (ext.)
W. Day, H. Edelsbrunner, Journal of Classification 1 (1984) 7–24.
1984 | Conference Paper | IST-REx-ID: 4122
Key-problems and key-methods in computational geometry
H. Edelsbrunner, in:, 1st Symposium of Theoretical Aspects of Computer Science, Springer, 1984, pp. 1–13.
View
| DOI
H. Edelsbrunner, in:, 1st Symposium of Theoretical Aspects of Computer Science, Springer, 1984, pp. 1–13.