摘要
提出了海量数据点集的四边形网格重建算法。首先根据精度要求简化数据点,按一定规则连接相邻的简化数据点生成多边形网格,对网格中高斯曲率较大的顶点进行局部细分提高其精度,然后对多边形网格进行整体细分使其全部转化为四边形网格,最后分裂度较大的顶点对其进行优化。实验结果表明,算法对拓扑结构较为复杂的海量数据点集的四边形网格重建是行之有效的。
A new algorithm to reconstruct quadrilateral meshes from large unorganized points with complex topology is proposed.The simplified points are connected with neighboring points according to given rules to form polygonal meshes,and then the polygonal meshes are subdivided to get higher precision and are changed into quadrilateral meshes.Finally,the vertices that have more degree are split.Experimental results demonstrate that the algorithm is fairly efficient for solving the problem of quadrilateral mesh reconstruction from complex data points.
出处
《图学学报》
CSCD
北大核心
2012年第2期14-20,共7页
Journal of Graphics
基金
国家自然科学基金资助项目(60873247)
关键词
高斯曲率
局部细分
整体细分
网格优化
gauss curvature
local subdivision
whole subdivision
mesh optimization