| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
Computing 2D Periodic Centroidal Voronoi Tessellation
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.
Cited literature [23 references]
https://hal.inria.fr/inria-00605927
Contributor : Dongming Yan <>
Submitted on : Tuesday, July 5, 2011 - 3:47:24 PM
Last modification on : Wednesday, April 28, 2021 - 1:42:01 PM
Long-term archiving on: : Thursday, October 6, 2011 - 2:20:54 AM
Contributor : Dongming Yan <>
Submitted on : Tuesday, July 5, 2011 - 3:47:24 PM
Last modification on : Wednesday, April 28, 2021 - 1:42:01 PM
Long-term archiving on: : Thursday, October 6, 2011 - 2:20:54 AM
File
pcvt2d_final.pdf
Files produced by the author(s)