详细信息

Uniform remeshing of 3D meshes of arbitrary topology using discrete constrained centroid voronoi clustering  ( EI收录)  

文献类型:期刊文献

英文题名:Uniform remeshing of 3D meshes of arbitrary topology using discrete constrained centroid voronoi clustering

作者:Lai, Shuhua[1]; He, Gaoqi[2,3]

机构:[1] School of Science and Technology, Georgia Gwinnett College, Lawrenceville, GA, 30043, United States; [2] Department of Computer Science and Engineering, East China University of Science and Technology, Shanghai, 200237, China; [3] State Key Laboratory of Virtual Reality Technology and Systems, Beihang University, Beijing, 100191, China

年份:2016

起止页码:335

外文期刊名:Proceedings of the 31st International Conference on Computers and Their Applications, CATA 2016

收录:EI(收录号:20162402485677)

语种:英文

外文关键词:Mesh generation - Topology - Reverse engineering - Three dimensional computer graphics

摘要:In this paper we propose a remeshing algorithm for altering the mesh geometry and connectivity of a 3D model to improve its uniformality. The new remeshing algorithm replaces an arbitrarily structured 3D mesh with a uniformly structured one, which has a given number of vertices, while approximates the original input mesh well. This is done through an elegant and efficient mesh clustering algorithm, which divides the faces of an input mesh into a given number of clusters for remeshing purpose by approximating the Centroidal Voronoi Tessellation of the mesh. With proliferation of 3D scanners, this remeshing algorithm is particularly useful for reverse engineering applications of 3D models, which in many cases are dense, nonuniform, irregular and arbitrary topology. Examples demonstrating effectiveness of the new algorithm are also included in the paper. Copyright ISCA.

参考文献:

正在载入数据...

版权所有©华东理工大学 重庆维普资讯有限公司 渝B2-20050021-7 
渝公网安备 50019002500408号 违法和不良信息举报中心