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.

1776 Publications


1991 | Conference Paper | IST-REx-ID: 4054
Edelsbrunner H, Seidel R, Sharir M. 1991. On the zone theorem for hyperplane arrangements. New Results and New Trends in Computer Science , LNCS, vol. 555, 108–123.
View | DOI | Download None (ext.)
 

1991 | Conference Paper | IST-REx-ID: 4059
Chazelle B, Edelsbrunner H, Grigni M, Guibas L, Hershberger J, Sharir M, Snoeyink J. 1991. Ray shooting in polygons using geodesic triangulations. 18th International Colloquium on Automata, Languages and Programming. ICALP: Automata, Languages and Programming, LNCS, vol. 510, 661–673.
View | DOI | Download None (ext.)
 

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

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

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

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

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

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

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

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

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

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

1990 | Book Chapter | IST-REx-ID: 4311
Barton NH, Clark A. 1990.Population structure and processes in evolution. In: Population biology: Ecological and evolutionary viewpoints. , 115–174.
View | DOI | Download None (ext.)
 

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

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

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

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

1988 | Journal Article | IST-REx-ID: 2523
Mizuno N, Ueyama T, Itoh K, Satoda T, Tashiro T, Shigemoto R. 1988. Direct projections from the subthalamic nucleus of Luys to the spinal cord in the Japanese monkey. Neuroscience Letters. 89(1), 13–18.
View | DOI | Download None (ext.) | PubMed | Europe PMC
 

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

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

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

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

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

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

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

1986 | Journal Article | IST-REx-ID: 4107
Edelsbrunner H, Haussler D. 1986. The complexity of cells in 3-dimensional arrangements. Discrete Mathematics. 60(C), 139–146.
View | DOI
 

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

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

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

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

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

1984 | Journal Article | IST-REx-ID: 4118
Edelsbrunner H, O’Rourke J, Welzl E. 1984. Stationing guards in rectilinear art galleries. Computer Vision, Graphics, and Image Processing. 27(2), 167–176.
View | DOI
 

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

1981 | Book Chapter | IST-REx-ID: 4332
Barton NH, Hewitt G. 1981.Hybrid zones and speciation. In: Evolution and Speciation. , 109–145.
View | Files available
 

1981 | Journal Article | IST-REx-ID: 4333 | OA
Barton NH, Hewitt G. 1981. The genetic basis of hybrid inviability between two chromosomal races of the grasshopper Podisma pedestris. Heredity. 47(3), 367–383.
[Published Version] View | DOI | Download Published Version (ext.)
 

1980 | Book Chapter | IST-REx-ID: 4334
Hewitt G, Barton NH. 1980.The structure and maintenance of hybrid zones as exemplified by Podisma pedestris. In: Insect Cytogenetics. Symposia of the Royal Entomological Society, vol. 10, 149–170.
View
 

Filters and Search Terms

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

Search

Filter Publications