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.

1932 Publications


1990 | Conference Paper | IST-REx-ID: 4076
Euclidean minimum spanning trees and bichromatic closest pairs
P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, E. Welzl, in:, Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 203–210.
View | DOI | Download None (ext.)
 

1990 | Conference Paper | IST-REx-ID: 4077
Points and triangles in the plane and halving planes in space
B. Aronov, B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, R. Wenger, in:, Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 112–115.
View | DOI | Download None (ext.)
 

1990 | Journal Article | IST-REx-ID: 4075
Searching for empty convex polygons
D. Dobkin, H. Edelsbrunner, M. Overmars, Algorithmica 5 (1990) 561–571.
View | DOI | Download None (ext.)
 

1990 | Book Chapter | IST-REx-ID: 4311
Population structure and processes in evolution
N.H. Barton, A. Clark, in:, K. Wöhrmann, S. Jain (Eds.), Population Biology: Ecological and Evolutionary Viewpoints, Springer, 1990, pp. 115–174.
View | DOI | Download None (ext.)
 

1989 | Journal Article | IST-REx-ID: 4088 | OA
Implicitly representing arrangements of lines or segments
H. Edelsbrunner, L. Guibas, J. Hershberger, R. Seidel, M. Sharir, J. Snoeyink, E. Welzl, Discrete & Computational Geometry 4 (1989) 433–466.
[Published Version] View | DOI | Download Published Version (ext.)
 

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

1989 | Journal Article | IST-REx-ID: 4084 | OA
Testing the necklace condition for shortest tours and optimal factors in the plane
H. Edelsbrunner, G. Rote, E. Welzl, Theoretical Computer Science 66 (1989) 157–180.
[Published Version] View | DOI | Download Published Version (ext.)
 

1989 | Conference Paper | IST-REx-ID: 4087
Tetrahedrizing point sets in three dimensions
H. Edelsbrunner, F. Preparata, D. West, in:, International Symposium on Symbolic and Algebraic Computation, Springer, 1989, pp. 315–331.
View | DOI | Download None (ext.)
 

1989 | Journal Article | IST-REx-ID: 3465
Temperature dependence of gating current in myelinated nerve fibers
P.M. Jonas, Journal of Membrane Biology 112 (1989) 277–289.
View | DOI | Download None (ext.) | PubMed | Europe PMC
 

1988 | Conference Paper | IST-REx-ID: 4097
Arrangements of curves in the plane - topology, combinatorics, and algorithms
H. Edelsbrunner, L. Guibas, J. Pach, R. Pollack, R. Seidel, M. Sharir, in:, 15th International Colloquium on Automata, Languages and Programming, Springer, 1988, pp. 214–229.
View | DOI | Download None (ext.)
 

1988 | Conference Paper | IST-REx-ID: 4096
Geometric structures in computational geometry
H. Edelsbrunner, in:, 15th International Colloquium on Automata, Languages and Programming, Springer, 1988, pp. 201–213.
View | DOI | Download None (ext.)
 

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

1988 | Book Chapter | IST-REx-ID: 4317
Speciation
N.H. Barton, in:, A. Myers, P. Giller (Eds.), Analytical Biogeography: An Integrated Approach to the Study of Animal and Plant Distributions, 1st ed., Springer, 1988, pp. 185–218.
View | DOI | Download None (ext.)
 

1987 | Journal Article | IST-REx-ID: 4100
Linear space data structures for two types of range search
B. Chazelle, H. Edelsbrunner, Discrete & Computational Geometry 2 (1987) 113–126.
View | DOI
 

1987 | Book | IST-REx-ID: 3900
Algorithms in Combinatorial Geometry
H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer, Berlin ; Heidelberg, 1987.
View | Files available | DOI
 

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
 

1986 | Journal Article | IST-REx-ID: 4103 | OA
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.)
 

1986 | Journal Article | IST-REx-ID: 3580
Edge-skeletons in arrangements with applications
H. Edelsbrunner, Algorithmica 1 (1986) 93–109.
View | DOI
 

1986 | Journal Article | IST-REx-ID: 4098 | OA
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.)
 

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
 

Filters and Search Terms

isbn%3D978-3-99078-004-6

Search

Filter Publications