1. Lecture Notes in Computer Science;M Abellanas,2001
2. Abellanas, M., Hurtado, F., Icking, C., Klein, R., Langetepe, E., Ma, L., Palop, B., Sacristán, V.: The farthest color Voronoi diagram and related problems. Technical report, University of Bonn (2006)
3. Agarwal, P.K., Sharir, M., Welzl, E.: Algorithms for center and tverberg points. ACM Trans. Algorithms 5(1), 1–20 (2008)
4. Chan, T.M.: An optimal randomized algorithm for maximum Tukey depth. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), pp. 430–436 (2004)
5. Jadhav, S., Mukhopadhyay, A.: Computing a centerpoint of a finite planar set of points in linear time. Discrete Comput. Geom. 12(3), 291–312 (1994)