Point Location

• H. Edelsbrunner, G. Haring and D. Hilbert. Rectangular point location in d dimensions with applications. Comput. J. 29 (1986), 76-82.
• H. Edelsbrunner, L. J. Guibas and J. Stolfi. Optimal point location in a monotone subdivision. SIAM J. Comput. 15 (1986), 317-340. pdf-file
• H. Edelsbrunner and H. A. Maurer. Finding extreme points in three dimensions and solving the post-office problem in the plane. Inform. Process. Lett. 21 (1985), 39-47.
• H. Edelsbrunner, D. G. Kirkpatrick and H. A. Maurer. Polygonal intersection searching. Inform. Process. Lett. 14 (1982), 74-79.
• H. Edelsbrunner and H. A. Maurer. A space-optimal solution of general region location. Theoret. Comput. Sci. 16 (1981), 329-336.

Range Search

• F. F. Yao, D. P. Dobkin, H. Edelsbrunner and M. S. Paterson. Partitioning space for range queries. SIAM J. Comput. 18 (1989), 371-384.
• B. Chazelle and H. Edelsbrunner. Linear space data structures for two types of range search. Discrete Comput. Geom. 2 (1987), 113-126.
• M. H. Overmars and H. Edelsbrunner. Zooming by repeated range detection. Inform. Process. Lett. 24 (1987), 413-417.
• D. P. Dobkin and H. Edelsbrunner. Space searching for intersecing objects. J. Algorithms 8 (1987), 348-361.
• H. Edelsbrunner and H. Welzl. Halfplanar range search in linear space and O(n^0.695). Inform. Process. Lett. 23 (1986), 289-293.
• B. Chazelle and H. Edelsbrunner. Optimal solutions for a class of point retrieval problems. J. Symbolic Comput. 1 (1985), 47-56.
• W. Bucher and H. Edelsbrunner. On expected-and worst-case segment trees. Advances in Computing Research Vol. 1, 109-125, ed.: F. P. Preparata, Jai Press, London, 1983.

Intersection

• A. Zomorodian and H. Edelsbrunner. Fast algorithms for box intersections. Internat. J. Comput. Geom. Appl. 12 (2002), 143-172. pdf-file
• D. P. Dobkin and H. Edelsbrunner. Ham-sandwich theorems applied to intersection problems. In ``Proc. Internat. Workshop on Graphtheoret. Concepts in Comput. Sci. 1984'', 88-99, Teubner.
• H. Edelsbrunner, J. v. Leeuwen, Th. Ottmann and D. Wood. Computing the connected components of simple rectilinear geometrical objects in d-space. RAIRO Inform. Theor. 18 (1984), 171-183.
• H. Edelsbrunner. A new approach to rectangle intersections -- part II. Internat. J. Comput. Math. 13 (1983), 221-229.
• H. Edelsbrunner. A new approach to rectangle intersections -- part I. Internat. J. Comput. Math. 13 (1983), 209-219.
• H. Edelsbrunner and M. H. Overmars. On the equivalence of some rectangle problems. Inform. Process. Lett. 14 (1982), 124-127.
• H. Edelsbrunner and H. A. Maurer. On the intersection of orthogonal objects. Inform. Process. Lett. 13 (1981), 177-181.