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.

26 Publications


1991 | Journal Article | IST-REx-ID: 4051
H. Edelsbrunner and W. Shi, “An O(n log^2 h) time algorithm for the three-dimensional convex hull problem,” SIAM Journal on Computing, vol. 20, no. 2. SIAM, pp. 259–269, 1991.
View | DOI | Download None (ext.)
 

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

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

1986 | Journal Article | IST-REx-ID: 4105
H. Edelsbrunner, J. O’Rourke, and R. Seidel, “Constructing arrangements of lines and hyperplanes with applications,” SIAM Journal on Computing, vol. 15, no. 2. SIAM, pp. 341–363, 1986.
View | DOI
 

1986 | Journal Article | IST-REx-ID: 4104
H. Edelsbrunner, L. Guibas, and J. Stolfi, “Optimal point location in a monotone subdivision,” SIAM Journal on Computing, vol. 15, no. 2. SIAM, pp. 317–340, 1986.
View | DOI
 

1986 | Journal Article | IST-REx-ID: 4110
H. Edelsbrunner and E. Welzl, “Constructing belts in two-dimensional arrangements with applications,” SIAM Journal on Computing, vol. 15, no. 1. SIAM, pp. 271–284, 1986.
View | DOI
 

Filters and Search Terms

issn=0097-5397

Search

Filter Publications