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.

1774 Publications


1991 | Journal Article | IST-REx-ID: 4061 | OA
Euclidean minimum spanning trees and bichromatic closest pairs
P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, E. Welzl, Discrete & Computational Geometry 6 (1991) 407–422.
[Published Version] View | DOI | Download Published Version (ext.)
 

1990 | Journal Article | IST-REx-ID: 3651 | OA
Pleiotropic models of quantitative variation
N.H. Barton, Genetics 124 (1990) 773–782.
[Published Version] View | DOI | Download Published Version (ext.) | PubMed | Europe PMC
 

1990 | Conference Paper | IST-REx-ID: 4067
A hyperplane Incidence problem with applications to counting distances
H. Edelsbrunner, M. Sharir, in:, Proceedings of the International Symposium on Algorithms, Springer, 1990, pp. 419–428.
View | DOI | Download None (ext.)
 

1990 | Journal Article | IST-REx-ID: 4066
The complexity of many cells in arrangements of planes and related problems
H. Edelsbrunner, L. Guibas, M. Sharir, Discrete & Computational Geometry 5 (1990) 197–216.
View | DOI | Download None (ext.)
 

1990 | Journal Article | IST-REx-ID: 4072
The complexity and construction of many faces in arrangements of lines and of segments
H. Edelsbrunner, L. Guibas, M. Sharir, Discrete & Computational Geometry 5 (1990) 161–196.
View | DOI | Download None (ext.)
 

1990 | Journal Article | IST-REx-ID: 4065
Covering convex sets with non-overlapping polygons
H. Edelsbrunner, A. Robison, X. Shen, Discrete Mathematics 81 (1990) 153–164.
View | DOI | Download None (ext.)
 

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

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

1988 | Journal Article | IST-REx-ID: 2523
Direct projections from the subthalamic nucleus of Luys to the spinal cord in the Japanese monkey
N. Mizuno, T. Ueyama, K. Itoh, T. Satoda, T. Tashiro, R. Shigemoto, Neuroscience Letters 89 (1988) 13–18.
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.)
 

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
 

Filters and Search Terms

isbn%3D978-3-642-40707-9

Search

Filter Publications