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.

2003 Publications


1990 | Journal Article | IST-REx-ID: 4070
Ranking intervals under visibility constraints
H. Edelsbrunner, M. Overmars, E. Welzl, I. Hartman, J. Feldman, International Journal of Computer Mathematics 34 (1990) 129–144.
View | DOI | Download None (ext.)
 

1990 | Conference Paper | IST-REx-ID: 4071
An O(n^2log n) time algorithm for the MinMax angle triangulation
H. Edelsbrunner, T. Tan, R. Waupotitsch, in:, Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 44–52.
View | DOI | Download None (ext.)
 

1990 | Journal Article | IST-REx-ID: 4068
The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2
H. Edelsbrunner, M. Sharir, Discrete & Computational Geometry 5 (1990) 35–42.
View | DOI | Download None (ext.)
 

1990 | Journal Article | IST-REx-ID: 4069
An acyclicity theorem for cell complexes in d dimension
H. Edelsbrunner, Combinatorica 10 (1990) 251–260.
View | DOI | Download None (ext.)
 

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

1990 | Journal Article | IST-REx-ID: 4064
Computing least median of squares regression lines and guided topological sweep
H. Edelsbrunner, D. Souvaine, Journal of the American Statistical Association 85 (1990) 115–119.
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: 4078
Slimming down by adding; selecting heavily covered points
B. Chazelle, H. Edelsbrunner, L. Guibas, J. Hershberger, R. Seidel, M. Sharir, in:, Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 116–127.
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 | Conference Paper | IST-REx-ID: 4510
An interleaving model for real time
T.A. Henzinger, Z. Manna, A. Pnueli, in:, Proceedings of the 5th Jerusalem Conference on Information Technology, IEEE, 1990, pp. 717–730.
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 | Conference Paper | IST-REx-ID: 4085
An acyclicity theorem for cell complexes in d dimension
H. Edelsbrunner, in:, Proceedings of the 5th Annual Symposium on Computational Geometry, ACM, 1989, pp. 145–151.
View | DOI | Download None (ext.)
 

1989 | Journal Article | IST-REx-ID: 4086 | OA
The upper envelope of piecewise linear functions: Tight bounds on the number of faces
H. Edelsbrunner, Discrete & Computational Geometry 4 (1989) 337–343.
[Published Version] View | DOI | Download Published Version (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
 

1989 | Journal Article | IST-REx-ID: 4080
Circles through two points that always enclose many points
H. Edelsbrunner, N. Hasan, R. Seidel, X. Shen, Geometriae Dedicata 32 (1989) 1–12.
View | DOI | Download None (ext.)
 

1989 | Journal Article | IST-REx-ID: 4314 View | DOI | Download None (ext.) | PubMed | Europe PMC
 

1989 | Conference Paper | IST-REx-ID: 4596
A really temporal logic
R. Alur, T.A. Henzinger, in:, 30th Annual Symposium on Foundations of Computer Science, IEEE, 1989, pp. 164–169.
View | DOI | Download None (ext.)
 

Filters and Search Terms

isbn%3D978-1-4503-3300-9

Search

Filter Publications