Isotropic Remeshing with Fast and Exact Computation of Restricted Voronoi Diagram

Dong-Ming Yan 1, 2 Bruno Lévy 1 Yang Liu 1 Feng Sun 2 Wenping Wang 2
1 ALICE - Geometry and Lighting
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [27 references]  Display  Hide  Download
Contributor : Dongming Yan <>
Submitted on : Friday, December 17, 2010 - 3:10:47 PM
Last modification on : Thursday, January 11, 2018 - 6:20:18 AM
Long-term archiving on: Friday, March 18, 2011 - 3:19:14 AM


Files produced by the author(s)




Dong-Ming Yan, Bruno Lévy, Yang Liu, Feng Sun, Wenping Wang. Isotropic Remeshing with Fast and Exact Computation of Restricted Voronoi Diagram. Computer Graphics Forum, Wiley, 2009, 28 (5), pp.1445-1454. ⟨10.1111/j.1467-8659.2009.01521.x⟩. ⟨inria-00547790⟩



Record views


Files downloads