Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. Abellanas, M., Hurtado, F., Icking, C., Klein, R., Langetepe, E., Ma, L., Sacristán, V.: The farthest color voronoi diagram and related problems (extended abstract). In: 17th European Workshop Computational Geometry, pp. 113–116 (2001)
2. Aurenhammer, F.: Voronoi diagrams—a survey of a fundamental geometric data structure. ACM Computing Surveys 23(3), 345–405 (1991)
3. Aurenhammer, F., Drysdale, R.L.S., Krasser, H.: Farthest line segment voronoi diagrams. Information Processing Letters 100(6), 220–225 (2006)
4. Buchin, K., Buchin, M., Van Kreveld, M., Löffler, M., Silveira, R.I., Wenk, C., Wiratma, L.: Median trajectories. In: Proceedings of the 18th Annual European Conference on Algorithms: Part I, pp. 463–474 (2010)
5. Cheong, O., Everett, H., Glisse, M., Gudmundsson, J., Hornus, S., Lazard, S., Lee, M., Na, H.S.: Farthest-polygon voronoi diagrams. In: Proceedings of the 15th Annual European Symposium on Algorithms, pp. 407–418 (2007)