Dobkin, David, and Herbert Edelsbrunner. “Space Searching for Intersecting Objects.”https://doi.org/10.1016/0196-6774(87)90015-0__Journal of Algorithms. Academic Press, 1987.https://doi.org/10.1016/0196-6774(87)90015-0 .
LibreCat: https://research-explorer.ista.ac.at/record/4102
DOI: 10.1016/0196-6774(87)90015-0

Edelsbrunner, Herbert, and Mark Overmars. “Batched Dynamic Solutions to Decomposable Searching Problems.”https://doi.org/10.1016/0196-6774(85)90030-6__Journal of Algorithms. Elsevier, 1985.https://doi.org/10.1016/0196-6774(85)90030-6 .
LibreCat: https://research-explorer.ista.ac.at/record/4112
DOI: 10.1016/0196-6774(85)90030-6

Edelsbrunner, Herbert. “Computing the Extreme Distances between Two Convex Polygons.”https://doi.org/10.1016/0196-6774(85)90039-2__Journal of Algorithms. Academic Press, 1985.https://doi.org/10.1016/0196-6774(85)90039-2 .
LibreCat: https://research-explorer.ista.ac.at/record/4115
DOI: 10.1016/0196-6774(85)90039-2