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. In: Proceedings of the 17th European Workshop on Computational Geometry, pp. 113–116 (2001)
3. Atallah, M., Bajaj, C.: Efficient algorithms for common transversal. Inf. Process. Lett. 25, 87–91 (1987)
4. Avis, D., Wenger, R.: Polyhedral line transversals in space. Discrete Comput. Geom. 3, 257–265 (1988)
5. Barba, L., Durocher, S., Fraser, R., Hurtado, F., Mehrabi, S., Mondal, D., Morrison, J., Skala, M., Wahid, M.A.: On
$$k$$
k
-enclosing objects in a coloured point set. In: Proc. of the 25th Canadian Conference on Computational Geometry, pp. 229–234 (2013)