Author:
Dinas Simena,Martínez Héctor J.
Publisher
Springer International Publishing
Reference15 articles.
1. Agarwal, P.K., Arge, L., Yi, K.: I/o-efficient construction of constrained Delaunay triangulations. In: Brodal, G., Leonardi, S. (eds.) Algorithms – ESA 2005, volume 3669 of Lecture Notes in Computer Science, pp. 355–366. Springer, Berlin/Heidelberg (2005). https://doi.org/10.1007/11561071_33
2. Anglada, M.V.: An improved incremental algorithm for constructing restricted Delaunay triangulations. Comput. Graph. 21(2), 215–223 (1997). https://doi.org/10.1016/S0097-8493(96)00085-4. Graphics Hardware
3. Chew, L.P.: Constrained Delaunay triangulations. In: Proceedings of the Third Annual Symposium on Computational Geometry, SCG 1987, pp. 215–222. ACM, New York (1987). https://doi.org/10.1145/41958.41981
4. Dinas, S., Bañón, J.M.: Representing extracted edges from images by using constrained Delaunay triangulation. In: Proceedings of IADIS International Conference Applied Computing, pp. 1–5 (2012)
5. Dinas, S., Martínez, H.J.: Constrained edges on kinetic Delaunay triangulation. Revista Ibérica de Sistemas e Tecnologias de Informação. 22, 174–186 (2019)