Edelsbrunner, H., &; Shi, W. (1991). An O(n log^2 h) time algorithm for the three-dimensional convex hull problem. SIAM Journal on Computing. SIAM.https://doi.org/10.1137/0220016  
LibreCat: https://research-explorer.ista.ac.at/record/4051
DOI: 10.1137/0220016 

Yao, F., Dobkin, D., Edelsbrunner, H., &; Paterson, M. (1989). Partitioning space for range queries. SIAM Journal on Computing. SIAM.https://doi.org/10.1137/0218025 
LibreCat: https://research-explorer.ista.ac.at/record/4083
DOI: 10.1137/0218025

Edelsbrunner, H., &; Skiena, S. (1988). Probing convex polygons with X-Rays. SIAM Journal on Computing. SIAM.https://doi.org/10.1137/0217054  
LibreCat: https://research-explorer.ista.ac.at/record/4091
DOI: 10.1137/0217054 

Edelsbrunner, H., O’Rourke, J., &; Seidel, R. (1986). Constructing arrangements of lines and hyperplanes with applications. SIAM Journal on Computing. SIAM.https://doi.org/10.1137/0215024 
LibreCat: https://research-explorer.ista.ac.at/record/4105
DOI: 10.1137/0215024

Edelsbrunner, H., Guibas, L., &; Stolfi, J. (1986). Optimal point location in a monotone subdivision. SIAM Journal on Computing. SIAM.https://doi.org/10.1137/0215023 
LibreCat: https://research-explorer.ista.ac.at/record/4104
DOI: 10.1137/0215023

Edelsbrunner, H., &; Welzl, E. (1986). Constructing belts in two-dimensional arrangements with applications. SIAM Journal on Computing. SIAM.https://doi.org/10.1137/0215019 
LibreCat: https://research-explorer.ista.ac.at/record/4110
DOI: 10.1137/0215019