自适应分割的动态网格生成算法  

A Dynamic Hierarchy Based on Adaptive Segmentation

作　　者：王健[1] 何明一[1] 

机构地区：[1]西北工业大学陕西省信息获取与处理重点实验室,西安710072

出　　处：《计算机辅助设计与图形学学报》2005年第7期1434-1439,共6页Journal of Computer-Aided Design & Computer Graphics

基　　金：国家自然科学基金(60172040);国家"八六三"高技术研究发展计划(2001AA131022)

摘　　要：提出一种基于半边数据结构的动态网格自适应分割生成算法·根据曲面尖锐特征对网格模型自适应分割;为满足分割边界的简化要求,提出一种利用半边数据结构的分割边界独立处理算法;并利用边界自适应加权函数,较好地保持了模型边界特征·应用实例表明,该算法高效、可靠,既保持模型细节特征,又减少了模型简化误差·According to surface characters of the models, the ASLOD (Adaptive Segmentation Level of Detail) approach is presented in the paper. This algorithm is an efficient multi-resolution triangulation framework based on the half-edge triangle mesh data structure. It takes advantages of the sharp features of the models to perform adaptive segmentation and simplification, with an approach ensuring the segmentation area simplified independently without creating tears or cracks. The natural hierarchy provided by this algorithm makes it particularly suited for applications such as progressive transmission and LOD hierarchy construction. The results show that the method is highly efficient in terms of both space and time cost, and it can render large models with important model features well preserved.

关 键 词：网格简化 二次误差测度 细节层次 尖锐特征 自适应分割 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]