Please note that IST 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.

6117 Publications


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
 

1986 | Journal Article | IST-REx-ID: 4108
Voronoi diagrams and arrangements
H. Edelsbrunner, R. Seidel, Discrete & Computational Geometry 1 (1986) 25–44.
View | DOI
 

1986 | Journal Article | IST-REx-ID: 4109
Rectangular point location in d-dimensions with applications
H. Edelsbrunner, G. Haring, D. Hilbert, Computer Journal 29 (1986) 76–82.
View | DOI
 

1986 | Journal Article | IST-REx-ID: 4110
Constructing belts in two-dimensional arrangements with applications
H. Edelsbrunner, E. Welzl, SIAM Journal on Computing 15 (1986) 271–284.
View | DOI
 

1986 | Journal Article | IST-REx-ID: 4321
Genetic analysis of a hybrid zone between the fire-bellied toads Bombina bombina and B. variegata, near Cracow in Southern Poland
J. Szymura, N.H. Barton, Evolution; International Journal of Organic Evolution 40 (1986) 1141–1159.
View | DOI
 

1986 | Journal Article | IST-REx-ID: 4323
Sibling competition and the advantage of mixed families
N.H. Barton, R. Post, Journal of Theoretical Biology 120 (1986) 381–387.
View | DOI
 

1986 | Journal Article | IST-REx-ID: 4324 View | DOI
 

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.
View | DOI
 

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
 

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
 

1985 | Journal Article | IST-REx-ID: 4113
On the number of line separations of a finite set in the plane
H. Edelsbrunner, E. Welzl, Journal of Combinatorial Theory Series A 38 (1985) 15–29.
View | DOI
 

1985 | Journal Article | IST-REx-ID: 4114
Investigation of Proportional Link Linkage Clustering Methods
W. Day, H. Edelsbrunner, Journal of Classification 2 (1985) 239–254.
View | DOI
 

1985 | Journal Article | IST-REx-ID: 4115
Computing the extreme distances between two convex polygons
H. Edelsbrunner, Journal of Algorithms 6 (1985) 213–224.
View | DOI
 

1985 | Journal Article | IST-REx-ID: 4116
Finding Transversals for Sets of Simple Geometric-Figures
H. Edelsbrunner, Theoretical Computer Science 35 (1985) 55–69.
View | DOI
 

1985 | Book Review | IST-REx-ID: 4325
Haldane's Rule OK
S. Jones, N.H. Barton, Nature 314 (1985) 668–668.
View | DOI
 

1985 | Journal Article | IST-REx-ID: 4326
Analysis of hybrid zones
N.H. Barton, G. Hewitt, Annual Review of Ecology and Systematics 16 (1985) 113–148.
View | DOI
 

1985 | Conference Paper | IST-REx-ID: 4241 View
 

1984 | Conference Paper | IST-REx-ID: 3513
Ham-sandwich theorems applied to intersection problems
D. Dobkin, H. Edelsbrunner, in:, Teubner, 1984, pp. 88–99.
View | Download (ext.)
 

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 (ext.)
 

1984 | Conference Paper | IST-REx-ID: 4122
Key-problems and key-methods in computational geometry
H. Edelsbrunner, in:, Springer, 1984, pp. 1–13.
View | DOI
 

Search

Filter Publications