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.

7 Publications


1992 | Journal Article | IST-REx-ID: 4048
A. Aggarwal, H. Edelsbrunner, P. Raghavan, and P. Tiwari, “Optimal time bounds for some proximity problems in the plane,” Information Processing Letters, vol. 42, no. 1. Elsevier, pp. 55–60, 1992.
View | DOI | Download None (ext.)
 

1987 | Journal Article | IST-REx-ID: 4101
H. Edelsbrunner and M. Overmars, “Zooming by repeated range detection,” Information Processing Letters, vol. 24, no. 6. Elsevier, pp. 413–417, 1987.
View | DOI | Download None (ext.)
 

1987 | Journal Article | IST-REx-ID: 4094
H. Edelsbrunner and X. Shen, “A tight lower bound on the size of visibility graphs,” Information Processing Letters, vol. 26, no. 2. Elsevier, pp. 61–64, 1987.
View | DOI | Download None (ext.)
 

1986 | Journal Article | IST-REx-ID: 4099
H. Edelsbrunner and E. Welzl, “Halfplanar range search in linear space and O(n0.695) query time,” Information Processing Letters, vol. 23, no. 5. Elsevier, pp. 289–293, 1986.
View | DOI
 

1985 | 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
 

1982 | Journal Article | IST-REx-ID: 4131
H. Edelsbrunner and M. Overmars, “On the equivalence of some rectangle problems,” Information Processing Letters, vol. 14, no. 3. Elsevier, pp. 124–127, 1982.
View | DOI
 

1982 | Journal Article | IST-REx-ID: 4130
H. Edelsbrunner, H. Maurer, and D. Kirkpatrick, “Polygonal intersection searching,” Information Processing Letters, vol. 14, no. 2. Elsevier, pp. 74–79, 1982.
View | DOI
 

Filters and Search Terms

eissn=1872-6119

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed