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
Aggarwal A, Edelsbrunner H, Raghavan P, Tiwari P. Optimal time bounds for some proximity problems in the plane. Information Processing Letters. 1992;42(1):55-60. doi:10.1016/0020-0190(92)90133-G
View
| DOI
| Download None (ext.)
1987 | Journal Article | IST-REx-ID: 4101
Edelsbrunner H, Overmars M. Zooming by repeated range detection. Information Processing Letters. 1987;24(6):413-417. doi:10.1016/0020-0190(87)90120-7
View
| DOI
| Download None (ext.)
1987 | Journal Article | IST-REx-ID: 4094
Edelsbrunner H, Shen X. A tight lower bound on the size of visibility graphs. Information Processing Letters. 1987;26(2):61-64. doi:10.1016/0020-0190(87)90038-X
View
| DOI
| Download None (ext.)
1986 | Journal Article | IST-REx-ID: 4099
Edelsbrunner H, Welzl E. Halfplanar range search in linear space and O(n0.695) query time. Information Processing Letters. 1986;23(5):289-293. doi:10.1016/0020-0190(86)90088-8
View
| DOI
1985 | Journal Article | IST-REx-ID: 4111
Edelsbrunner H, Maurer H. Finding extreme-points in 3-dimensions and solving the post-office problem in the plane. Information Processing Letters. 1985;21(1):39-47. doi:10.1016/0020-0190(85)90107-3
View
| DOI
1982 | Journal Article | IST-REx-ID: 4131
Edelsbrunner H, Overmars M. On the equivalence of some rectangle problems. Information Processing Letters. 1982;14(3):124-127. doi:10.1016/0020-0190(82)90068-0
View
| DOI
1982 | Journal Article | IST-REx-ID: 4130
Edelsbrunner H, Maurer H, Kirkpatrick D. Polygonal intersection searching. Information Processing Letters. 1982;14(2):74-79. doi:10.1016/0020-0190(82)90090-4
View
| DOI