A Systematic Review of Algorithms with Linear-time Behaviour to Generate Delaunay and Voronoi Tessellations
S,erson L. Gonzaga de Oliveira1, Jéssica Renata Nogueira1, João Manuel R. S. Tavares2
Departamento de Ciência da Computação, Universidade Federal de Lavras, Lavras, MG, Brazil, sanderson@dcc.ufla.br, jes.r.nogueira@gmail.com
Instituto de Engenharia Mecânica e Gestão Industrial, Departamento de Engenharia Mecânica, Faculdade de Engenharia, Universidade do Porto, Porto, Portugal, tavares@fe.up.pt
Triangulations and tetrahedrizations are important geometrical discretization procedures applied to several areas, such as the reconstruction of surfaces and data visualization. Delaunay and Voronoi tessellations are discretization structures of domains with desirable geometrical properties. In this work, a systematic review of algorithms with linear-time behaviour to generate 2D/3D Delaunay and/or Voronoi tessellations is presented.
L., S., Nogueira, J. R., Manuel, J. (2014). A Systematic Review of Algorithms with Linear-time Behaviour to Generate Delaunay and Voronoi Tessellations. CMES-Computer Modeling in Engineering & Sciences, 100(1), 31–57.
This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.