Minimum polygonal separation. H. Edelsbrunner and R. Waupotitsch. Computing a ham-sandwich cut in two dimensions. J. Symbolic Comput. Distance and Proximity A. Aggarwal, H. Edelsbrunner, P. Raghavan and P. Tiwari.
Optimal time bounds for some proximity problems in the plane.
P. K. Agarwal, H. Edelsbrunner, O. Schwarzkopf and E. Welzl. Euclidean minimum spanning trees and bichromatic closest pairs. H. Edelsbrunner, G. Rote and E. Welzl. Testing the necklace condition for shortest tours and optimal factors in the plane. B. Chazelle and H. Edelsbrunner.