1. The overlay of lower envelopes and its applications;Agarwal;Discrete Computational Geometry,1996
2. Competitive facility location: The Voronoi game;Ahn;Theoretical Computer Science,2004
3. N.M. Amato, M.T. Goodrich, E.A. Ramos, Computing the arrangement of curve segments: Divide-and-conquer algorithms via sampling, in: Proc. 11th ACM-SIAM Sympos. Discrete Algorithms, 2000, pp. 705–706.
4. B. Aronov, S. Har-Peled, On approximating the depth and related problems, in: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 2005.
5. Voronoi diagrams;Aurenhammer,2000