CASIA OpenIR  > 模式识别国家重点实验室  > 多媒体计算与图形学
Computing 2D Periodic Centroidal Voronoi Tessellation
Yan, Dong-Ming; Wang, Kai; Lévy, Bruno; Alonso Laurent
Conference Name8th International Symposium on Voronoi Diagrams in Science and Engineering - ISVD 2011
Conference Date2011-06
Conference PlaceQing Dao
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会议论文
Recommended Citation
GB/T 7714
Yan, Dong-Ming,Wang, Kai,Lévy, Bruno,et al. Computing 2D Periodic Centroidal Voronoi Tessellation[C],2011.
Files in This Item: Download All
File Name/Size DocType Version Access License
2011_ISVD_PCVT.pdf(5072KB)会议论文 开放获取CC BY-NC-SAView Download
Related Services
Recommend this item
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Yan, Dong-Ming]'s Articles
[Wang, Kai]'s Articles
[Lévy, Bruno]'s Articles
Baidu academic
Similar articles in Baidu academic
[Yan, Dong-Ming]'s Articles
[Wang, Kai]'s Articles
[Lévy, Bruno]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Yan, Dong-Ming]'s Articles
[Wang, Kai]'s Articles
[Lévy, Bruno]'s Articles
Terms of Use
No data!
Social Bookmark/Share
File name: 2011_ISVD_PCVT.pdf
Format: Adobe PDF
All comments (0)
No comment.

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.