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.

1464 Publications


1990 | Book Chapter | IST-REx-ID: 3565
D. Dobkin, H. Edelsbrunner, and C. Yap, “Probing convex polytopes,” in Autonomous Robot Vehicles, I. Cox and G. Wilfong, Eds. Springer, 1990, pp. 328–341.
View | DOI | Download None (ext.)
 

1990 | Journal Article | IST-REx-ID: 4064
H. Edelsbrunner and D. Souvaine, “Computing least median of squares regression lines and guided topological sweep,” Journal of the American Statistical Association, vol. 85, no. 409. American Statistical Association, pp. 115–119, 1990.
View | DOI | Download None (ext.)
 

1990 | Journal Article | IST-REx-ID: 4074
K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, and E. Welzl, “Combinatorial complexity bounds for arrangements of curves and spheres,” Discrete & Computational Geometry, vol. 5, no. 1. Springer, pp. 99–160, 1990.
View | DOI | Download None (ext.)
 

1990 | Conference Paper | IST-REx-ID: 4076
P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, and E. Welzl, “ Euclidean minimum spanning trees and bichromatic closest pairs,” in Proceedings of the 6th annual symposium on Computational geometry, Berkeley, CA, United States, 1990, pp. 203–210.
View | DOI | Download None (ext.)
 

1989 | Journal Article | IST-REx-ID: 2526
T. Ino et al., “Direct projections from Ammon’s horn to the rostral raphe regions in the brainstem of the cat,” Brain Research, vol. 479, no. 1. Elsevier, pp. 157–161, 1989.
View | DOI | Download None (ext.) | PubMed | Europe PMC
 

1989 | Journal Article | IST-REx-ID: 4088 | OA
H. Edelsbrunner et al., “Implicitly representing arrangements of lines or segments,” Discrete & Computational Geometry, vol. 4, no. 1. Springer, pp. 433–466, 1989.
[Published Version] View | DOI | Download Published Version (ext.)
 

1989 | Journal Article | IST-REx-ID: 4083 | OA
F. Yao, D. Dobkin, H. Edelsbrunner, and M. Paterson, “Partitioning space for range queries,” SIAM Journal on Computing, vol. 18, no. 2. SIAM, pp. 371–384, 1989.
[Published Version] View | DOI | Download Published Version (ext.)
 

1989 | Journal Article | IST-REx-ID: 4314
N. H. Barton, “The divergence of a polygenic system under stabilising selection, mutation and drift,” Genetical Research, vol. 54, no. 1. Cambridge University Press, pp. 59–78, 1989.
View | DOI | Download None (ext.) | PubMed | Europe PMC
 

1988 | Journal Article | IST-REx-ID: 4091
H. Edelsbrunner and S. Skiena, “Probing convex polygons with X-Rays,” SIAM Journal on Computing, vol. 17, no. 5. SIAM, pp. 870–882, 1988.
View | DOI | Download None (ext.)
 

1987 | Conference Paper | IST-REx-ID: 3514
H. Edelsbrunner, J. Pach, J. Schwartz, and M. Sharir, “On the lower envelope of bivariate functions and its applications,” in 28th Annual Symposium on Foundations of Computer Science , Los Angeles, CA, USA, 1987, pp. 27–37.
View | DOI | Download None (ext.)
 

1987 | Journal Article | IST-REx-ID: 3661
N. H. Barton and S. Rouhani, “The frequency of shifts between alternative equilibria,” Journal of Theoretical Biology, vol. 125, no. 4. Elsevier, pp. 397–418, 1987.
View | DOI | Download None (ext.)
 

1986 | Journal Article | IST-REx-ID: 4105
H. Edelsbrunner, J. O’Rourke, and R. Seidel, “Constructing arrangements of lines and hyperplanes with applications,” SIAM Journal on Computing, vol. 15, no. 2. SIAM, pp. 341–363, 1986.
View | DOI
 

1986 | Journal Article | IST-REx-ID: 4103 | OA
H. Edelsbrunner and E. Welzl, “On the maximal number of edges of many faces in an arrangement,” Journal of Combinatorial Theory Series A, vol. 41, no. 2. Elsevier, pp. 159–166, 1986.
[Published Version] View | DOI | Download Published Version (ext.)
 

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

1986 | Journal Article | IST-REx-ID: 3580
H. Edelsbrunner, “Edge-skeletons in arrangements with applications,” Algorithmica, vol. 1, no. 1–4. Springer, pp. 93–109, 1986.
View | DOI
 

1985 | Journal Article | IST-REx-ID: 4113
H. Edelsbrunner and E. Welzl, “On the number of line separations of a finite set in the plane,” Journal of Combinatorial Theory Series A, vol. 38, no. 1. Elsevier, pp. 15–29, 1985.
View | DOI
 

1985 | Journal Article | IST-REx-ID: 4116 | OA
H. Edelsbrunner, “Finding Transversals for Sets of Simple Geometric-Figures,” Theoretical Computer Science, vol. 35, no. 1. Elsevier, pp. 55–69, 1985.
[Published Version] View | DOI | Download Published Version (ext.)
 

1985 | Journal Article | IST-REx-ID: 4114
W. Day and H. Edelsbrunner, “Investigation of Proportional Link Linkage Clustering Methods,” Journal of Classification, vol. 2, no. 2–3. Springer, pp. 239–254, 1985.
View | DOI
 

1985 | Journal Article | IST-REx-ID: 4115
H. Edelsbrunner, “Computing the extreme distances between two convex polygons,” Journal of Algorithms, vol. 6, no. 2. Academic Press, pp. 213–224, 1985.
View | DOI
 

1984 | Journal Article | IST-REx-ID: 4121
W. Day and H. Edelsbrunner, “Efficient algorithms for agglomerative hierarchical clustering methods,” Journal of Classification, vol. 1. Springer, pp. 7–24, 1984.
View | DOI | Download None (ext.)
 

Filters and Search Terms

isbn%3D978-161197478-2

Search

Filter Publications