1. Abellanas, M., Hurtado, F., Icking, C., Klein, R., Langetepe, E., Ma, L., Palop, B., Sacristan, V.: The Farthest Color Voronoi Diagram and Related Problems. In: Abstracts 17th European Workshop Comput. Geom. (2001)
2. Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Geometric Approximation via Coresets. Combinatorial and Computational Geometry 52, 1–30 (2005)
3. Badoiu, M., Clarkson, K.: Smaller core-sets for balls. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 801–802 (2003)
4. Badoiu, M., Har-Peled, S., Indyk, P.: Approximate clustering via core-sets. In: Proceedings of the 34th Symposium on Theory of Computing, pp. 250–257 (2002)
5. Cheong, O., Everett, H., Glisse, M., Gudmundsson, J., Hornus, S., Lazard, S., Lee, M., Na, H.: Farthest-Polygon Voronoi Diagrams. In: Proceedings of the 15th Annual European Conference on Algorithms, pp. 407-418 (2007)