Spatial tessellations: concepts and applications of Voronoi diagrams
Spatial tessellations: concepts and applications of Voronoi diagrams
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Hierarchical face clustering on polygonal surfaces
I3D '01 Proceedings of the 2001 symposium on Interactive 3D graphics
Least squares conformal maps for automatic texture atlas generation
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Superfaces: Polygonal Mesh Simplification with Bounded Error
IEEE Computer Graphics and Applications
Constrained Centroidal Voronoi Tessellations for Surfaces
SIAM Journal on Scientific Computing
Variational shape approximation
ACM SIGGRAPH 2004 Papers
Generic Remeshing of 3D Triangular Meshes with Metric-Dependent Discrete Voronoi Diagrams
IEEE Transactions on Visualization and Computer Graphics
| Hi-index | 0.00 |
An elegant and efficient mesh clustering algorithm is presented. The faces of a polygonal mesh are divided into different clusters for mesh coarsening purpose by approximating the Centroidal Voronoi Tessellation of the mesh. The mesh coarsening process after clustering can be done in an isotropic or anisotropic fashion. The presented algorithm improves previous techniques in local geometric operations and parallel updates. The new algorithm is very simple but is guaranteed to converge, and generates better approximating meshes with the same computation cost. Moreover, the new algorithm is suitable for the variational shape approximation problem with L2, 1 distortion error metric and the convergence is guaranteed. Examples demonstrating efficiency of the new algorithm are also included in the paper.