@Article{NMTMA-3-2,
author = {},
title = {2D Centroidal Voronoi Tessellations with Constraints},
journal = {Numerical Mathematics: Theory, Methods and Applications},
year = {2010},
volume = {3},
number = {2},
pages = {212--222},
abstract = {<p style="text-align: justify;">We tackle the problem of constructing 2D centroidal Voronoi tessellations
with constraints through an efficient and robust construction of bounded Voronoi diagrams,
the pseudo-dual of the constrained Delaunay triangulation. We exploit the fact
that the cells of the bounded Voronoi diagram can be obtained by clipping the ordinary
ones against the constrained Delaunay edges. The clipping itself is efficiently computed
by identifying for each constrained edge the (connected) set of triangles whose dual
Voronoi vertices are hidden by the constraint. The resulting construction is amenable to
Lloyd relaxation so as to obtain a centroidal tessellation with constraints.</p>},
issn = {2079-7338},
doi = {https://doi.org/10.4208/nmtma.2010.32s.6},
url = {https://global-sci.com/article/90724/2d-centroidal-voronoi-tessellations-with-constraints}
}