Author:
Dinas Simena,Martínez Hector J.
Publisher
Springer International Publishing
Reference17 articles.
1. Agarwal, P.K., Kaplan, H., Rubin, N., Sharir, M.: Kinetic voronoi diagrams and delaunay triangulations under polygonal distance functions. Discrete Comput. Geom. 54(4), 871–904 (2015). Available at https://doi.org/10.1007/s00454-015-9729-3
2. Allen, S.R., Barba, L., Iacono, J., Langerman, S.: Incremental voronoi diagrams. CoRR, abs/1603.08485 (2016)
3. Biniaz, A., Dastghaibyfard, G.: A faster circle-sweep delaunay triangulation algorithm. Adv. Eng. Softw. 43(1), 1–13 (2012). https://doi.org/10.1016/j.advengsoft.2011.09.003
4. Bowyer, A.: Computing dirichlet tessellations. Comput. J. 24(2), 162–166 (1981). https://doi.org/10.1093/comjnl/24.2.162
5. Chew, L.P.: Building Voronoi Diagrams for Convex Polygons in Linear Expected Time. Technical Report. Dartmouth College, Hanover (1990)