Computing 2D Periodic Centroidal Voronoi Tessellation

Dong-Ming Yan 1, * Kai Wang 1, 2 Bruno Lévy 1 Laurent Alonso 1
* Corresponding author
1 ALICE - Geometry and Lighting
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : In this paper, we propose an efficient algorithm to compute the centroidal Voronoi tessellation in 2D periodic space. We first present a simple algorithm for constructing the periodic Voronoi diagram (PVD) from a Euclidean Voronoi diagram. The presented PVD algorithm considers only a small set of periodic copies of the input sites, which is more efficient than previous approaches requiring full copies of the sites (9 in 2D and 27 in 3D). The presented PVD algorithm is applied in a fast Newton-based framework for computing the centroidal Voronoi tessellation (CVT). We observe that full-hexagonal patterns can be obtained via periodic CVT optimization attributed to the convergence of the Newton-based CVT computation.
Document type :
Conference papers
Complete list of metadatas

Cited literature [23 references]  Display  Hide  Download

https://hal.inria.fr/inria-00605927
Contributor : Dongming Yan <>
Submitted on : Tuesday, July 5, 2011 - 3:47:24 PM
Last modification on : Monday, April 9, 2018 - 12:22:14 PM
Long-term archiving on : Thursday, October 6, 2011 - 2:20:54 AM

File

pcvt2d_final.pdf
Files produced by the author(s)

Identifiers

Citation

Dong-Ming Yan, Kai Wang, Bruno Lévy, Laurent Alonso. Computing 2D Periodic Centroidal Voronoi Tessellation. 8th International Symposium on Voronoi Diagrams in Science and Engineering - ISVD2011, Jun 2011, Qingdao, China. ⟨10.1109/ISVD.2011.31⟩. ⟨inria-00605927⟩

Share

Metrics

Record views

929

Files downloads

2249