CASIA OpenIR  > 模式识别国家重点实验室  > 多媒体计算与图形学
 Isotropic Remeshing with Fast and Exact Computation of Restricted Voronoi Diagram Yan, Dong-Ming; Lévy, Bruno; Liu, Yang; Sun, Feng; Wang Wenping Source Publication Computer Graphics Forum 2009 Volume 28Issue:5Pages:1445-1454 Abstract We propose a new isotropic remeshing method, based on Centroidal Voronoi Tessellation (CVT). Constructing CVT requires to repeatedly compute Restricted Voronoi Diagram (RVD), defined as the intersection between a 3D Voronoi diagram and an input mesh surface. Existing methods use some approximations of RVD. In this paper, we introduce an efficient algorithm that computes RVD exactly and robustly. As a consequence, we achieve better remeshing quality than approximation-based approaches, without sacrificing efficiency. Our method for RVD computation uses a simple procedure and a kd-tree to quickly identify and compute the intersection of each triangle face with its incident Voronoi cells. Its time complexity is O(mlogn), where n is the number of seed points and m is the number of triangles of the input mesh. Fast convergence of CVT is achieved using a quasi-Newton method, which proved much faster than Lloyd’s iteration. Examples are presented to demonstrate the better quality of remeshing results with our method than with the state-of-art approaches. Keyword Restricted Voronoi Diagram Document Type 期刊论文 Identifier http://ir.ia.ac.cn/handle/173211/14018 Collection 模式识别国家重点实验室_多媒体计算与图形学 Recommended CitationGB/T 7714 Yan, Dong-Ming,Lévy, Bruno,Liu, Yang,et al. Isotropic Remeshing with Fast and Exact Computation of Restricted Voronoi Diagram[J]. Computer Graphics Forum,2009,28(5):1445-1454. APA Yan, Dong-Ming,Lévy, Bruno,Liu, Yang,Sun, Feng,&Wang Wenping.(2009).Isotropic Remeshing with Fast and Exact Computation of Restricted Voronoi Diagram.Computer Graphics Forum,28(5),1445-1454. MLA Yan, Dong-Ming,et al."Isotropic Remeshing with Fast and Exact Computation of Restricted Voronoi Diagram".Computer Graphics Forum 28.5(2009):1445-1454.