Author:
Junginger Kolja,Mantas Ioannis,Papadopoulou Evanthia
Publisher
Springer International Publishing
Reference10 articles.
1. Aggarwal, A., Guibas, L., Saxe, J., Shor, P.: A linear-time algorithm for computing the Voronoi diagram of a convex polygon. Discret. Comput. Geom. 4, 591–604 (1989)
2. Bohler, C., Cheilaris, P., Klein, R., Liu, C.H., Papadopoulou, E., Zavershynskyi, M.: On the complexity of higher order abstract Voronoi diagrams. Comput. Geom.: Theory Appl. 48(8), 539–551 (2015)
3. Bohler, C., Klein, R., Lingas, A., Liu, C.-H.: Forest-like abstract Voronoi diagrams in linear time. Comput. Geom. 68, 134–145 (2018)
4. Chin, F., Snoeyink, J., Wang, C.A.: Finding the medial axis of a simple polygon in linear time. Discret. Comput. Geom. 21(3), 405–420 (1999)
5. Junginger, K., Papadopoulou, E.: Deletion in abstract Voronoi diagrams in expected linear time. In: Proceedings of 34th International Symposium on Computational Geometry (SoCG), LIPIcs, vol. 99, pp. 50:1–50:14 (2018)