Incremental topological flipping works for regular triangulations
H. Edelsbrunner, N. Shah, Algorithmica 15 (1996) 223–241.
LibreCat: https://research-explorer.ista.ac.at/record/4026
DOI: 10.1007/BF01975867

Fully dynamic biconnectivity in graphs
M.H. Henzinger, Algorithmica 13 (1995) 503–538.
LibreCat: https://research-explorer.ista.ac.at/record/11677
DOI: 10.1007/bf01189067

Ray shooting in polygons using geodesic triangulations
B. Chazelle, H. Edelsbrunner, M. Grigni, L. Guibas, J. Hershberger, M. Sharir, J. Snoeyink, Algorithmica 12 (1994) 54–68.
LibreCat: https://research-explorer.ista.ac.at/record/4039
DOI: 10.1007/BF01377183

Algorithms for bichromatic line-segment problems and polyhedral terrains
B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, Algorithmica 11 (1994) 116–132.
LibreCat: https://research-explorer.ista.ac.at/record/4038
DOI: 10.1007/BF01182771

Searching for empty convex polygons
D. Dobkin, H. Edelsbrunner, M. Overmars, Algorithmica 5 (1990) 561–571.
LibreCat: https://research-explorer.ista.ac.at/record/4075
DOI: 10.1007/BF01840404

Edge-skeletons in arrangements with applications
H. Edelsbrunner, Algorithmica 1 (1986) 93–109.
LibreCat: https://research-explorer.ista.ac.at/record/3580
DOI: 10.1007/BF01840438