Edelsbrunner, Herbert, Tiow Tan, and Roman Waupotitsch. “An O(N^2 Log n) Time Algorithm for the MinMax Angle Triangulation.”https://doi.org/10.1137/0913058__SIAM Journal on Scientific Computing. Society for Industrial and Applied Mathematics , 1992.https://doi.org/10.1137/0913058 .

Edelsbrunner, Herbert, and Weiping Shi. “An O(n Log^2 h) Time Algorithm for the Three-Dimensional Convex Hull Problem.”https://doi.org/10.1137/0220016 __SIAM Journal on Computing. SIAM, 1991.https://doi.org/10.1137/0220016  .

Yao, F., David Dobkin, Herbert Edelsbrunner, and Michael Paterson. “Partitioning Space for Range Queries.”https://doi.org/10.1137/0218025__SIAM Journal on Computing. SIAM, 1989.https://doi.org/10.1137/0218025 .

Edelsbrunner, Herbert, and Steven Skiena. “Probing Convex Polygons with X-Rays.”https://doi.org/10.1137/0217054 __SIAM Journal on Computing. SIAM, 1988.https://doi.org/10.1137/0217054  .

Edelsbrunner, Herbert, Joseph O’Rourke, and Raimund Seidel. “Constructing Arrangements of Lines and Hyperplanes with Applications.”https://doi.org/10.1137/0215024__SIAM Journal on Computing. SIAM, 1986.https://doi.org/10.1137/0215024 .

Edelsbrunner, Herbert, Leonidas Guibas, and Jorge Stolfi. “Optimal Point Location in a Monotone Subdivision.”https://doi.org/10.1137/0215023__SIAM Journal on Computing. SIAM, 1986.https://doi.org/10.1137/0215023 .

Edelsbrunner, Herbert, and Emo Welzl. “Constructing Belts in Two-Dimensional Arrangements with Applications.”https://doi.org/10.1137/0215019__SIAM Journal on Computing. SIAM, 1986.https://doi.org/10.1137/0215019 .