节点文献
基于子分规则的边折叠简化方法
Edge Collapse Simplification Based on Subdivision
【摘要】 边折叠简化方法是一种主要的三角网格简化方法 ,已成为多分辨率自适应曲面参数化、基于法向细节的几何压缩、渐进网格算法的重要组成部分 .文中采用子分的思想生成三角网格模型的新顶点 ,从而减小了简化模型和原始模型之间的误差 ;此外 ,还给出保持模型流形的方法 ;最后给出一种新的计算简化网格与原始网格之间的 Metro距离的采样方法 ,并分析这个距离误差
【Abstract】 Edge collapse simplification is one of the most important triangular mesh simplification algorithms. It is a basic one in multiresolution adaptive parameterization of surfaces, geometric compression based on normal detail, progressive transmission of meshes and so on. Traditional edge collapse simplification algorithms generate new vertex by choosing one of the two endpoints or the middle point of an edge that will be collapsed. The position of the new vertex is not accurate enough by these approaches. Our method computes new vertex by the butterfly subdivision scheme to reduce the approximation error between the simplified model and the original one and preserve the manifold topology of model that is unable to be maintained by other approaches. Finally, we give a new sampling method for error computation and analysis of Metro distance.
- 【文献出处】 计算机辅助设计与图形学学报 ,Journal of Computer Aided Design & Computer Graphics , 编辑部邮箱 ,2002年01期
- 【分类号】TP391.41
- 【被引频次】82
- 【下载频次】260