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.

1621 Publications


1990 |Published| Conference Paper | IST-REx-ID: 4077
B. Aronov, B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, and R. Wenger, “Points and triangles in the plane and halving planes in space,” in Proceedings of the 6th annual symposium on Computational geometry, Berkley, CA, United States, 1990, pp. 112–115.
View | DOI | Download None (ext.)
 

1990 |Published| Journal Article | IST-REx-ID: 4075
D. Dobkin, H. Edelsbrunner, and M. Overmars, “Searching for empty convex polygons,” Algorithmica, vol. 5, no. 4. Springer, pp. 561–571, 1990.
View | DOI | Download None (ext.)
 

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

1989 |Published| 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 |Published| 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 |Published| Journal Article | IST-REx-ID: 4084 | OA
H. Edelsbrunner, G. Rote, and E. Welzl, “Testing the necklace condition for shortest tours and optimal factors in the plane,” Theoretical Computer Science, vol. 66, no. 2. Elsevier, pp. 157–180, 1989.
[Published Version] View | DOI | Download Published Version (ext.)
 

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

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

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

1987 |Published| Journal Article | IST-REx-ID: 4100
B. Chazelle and H. Edelsbrunner, “Linear space data structures for two types of range search,” Discrete & Computational Geometry, vol. 2, no. 1. Springer, pp. 113–126, 1987.
View | DOI
 

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

1986 |Published| 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
 

1986 |Published| Journal Article | IST-REx-ID: 4098 | OA
H. Edelsbrunner and G. Stöckl, “The number of extreme pairs of finite point-sets in Euclidean spaces,” Journal of Combinatorial Theory Series A, vol. 43, no. 2. Elsevier, pp. 344–349, 1986.
View | DOI | Download None (ext.)
 

1986 |Published| Journal Article | IST-REx-ID: 4107
H. Edelsbrunner and D. Haussler, “The complexity of cells in 3-dimensional arrangements,” Discrete Mathematics, vol. 60, no. C. Elsevier, pp. 139–146, 1986.
View | DOI
 

1985 |Published| Journal Article | IST-REx-ID: 4111
H. Edelsbrunner and H. Maurer, “Finding extreme-points in 3-dimensions and solving the post-office problem in the plane,” Information Processing Letters, vol. 21, no. 1. Elsevier, pp. 39–47, 1985.
View | DOI
 

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

1984 |Published| Conference Paper | IST-REx-ID: 4122
H. Edelsbrunner, “Key-problems and key-methods in computational geometry,” in 1st Symposium of Theoretical Aspects of Computer Science, Paris, France, 1984, vol. 166, pp. 1–13.
View | DOI
 

1984 |Published| Conference Paper | IST-REx-ID: 3513
D. Dobkin and H. Edelsbrunner, “Ham-sandwich theorems applied to intersection problems,” in 9th International Workshop on Graph Theoretic Concepts in Computer Science, Haus Ohrbeck, Germany, 1984, pp. 88–99.
View | Download None (ext.)
 

1984 |Published| Conference Paper | IST-REx-ID: 4119
H. Edelsbrunner and E. Welzl, “Monotone edge sequences in line arrangements and applications,” in 11th International Symposium on Mathematical Foundations of Computer Science, Praha, Czechoslovakia, 1984, vol. 176, pp. 265–272.
View | DOI
 

1981 |Published| Journal Article | IST-REx-ID: 4132 | OA
H. Edelsbrunner and H. Maurer, “On the intersection of Orthogonal objects,” Information Processing Letters, vol. 13, no. 4–5. Elsevier, pp. 177–181, 1981.
[Published Version] View | DOI | Download Published Version (ext.)
 

Filters and Search Terms

isbn%3D978-364254630-3

Search

Filter Publications