Subject
General Computer Science,Theoretical Computer Science
Reference12 articles.
1. M. Abellanas, F. Hurtado, C. Icking, R. Klein, E. Langetepe, L. Ma, V. Sacristán, The farthest color Voronoi diagram and related problems (extended abstract), in: 17th European Workshop Computational Geometry, 2001, pp. 113–116.
2. Voronoi diagrams—a survey of a fundamental geometric data structure;Aurenhammer;ACM Computing Surveys,1991
3. Farthest line segment Voronoi diagrams;Aurenhammer;Information Processing Letters,2006
4. K. Buchin, M. Buchin, M. Van Kreveld, M. Löffler, R.I. Silveira, C. Wenk, L. Wiratma, Median trajectories, in: Proceedings of the 18th Annual European Conference on Algorithms: Part I, 2010, pp. 463–474.
5. O. Cheong, H. Everett, M. Glisse, J. Gudmundsson, S. Hornus, S. Lazard, M. Lee, H.S. Na, Farthest-polygon Voronoi diagrams, in: Proceedings of the 15th Annual European Symposium on Algorithms, 2007, pp. 407–418.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Radius of Robust Feasibility for Uncertain Farthest Voronoi Cells;Set-Valued and Variational Analysis;2023-03
2. On farthest Voronoi cells;Linear Algebra and its Applications;2019-12