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.
LibreCat: https://research-explorer.ista.ac.at/record/4051
DOI: 10.1137/0220016 

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.
LibreCat: https://research-explorer.ista.ac.at/record/4083
DOI: 10.1137/0218025

H. Edelsbrunner and S. Skiena, “Probing convex polygons with X-Rays,” SIAM Journal on Computing, vol. 17, no. 5. SIAM, pp. 870–882, 1988.
LibreCat: https://research-explorer.ista.ac.at/record/4091
DOI: 10.1137/0217054 

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.
LibreCat: https://research-explorer.ista.ac.at/record/4105
DOI: 10.1137/0215024

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.
LibreCat: https://research-explorer.ista.ac.at/record/4104
DOI: 10.1137/0215023

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.
LibreCat: https://research-explorer.ista.ac.at/record/4110
DOI: 10.1137/0215019