高级检索
    计忠平 刘利刚 王国瑾. 基于割角的保特征网格简化算法[J]. 计算机研究与发展, 2006, 43(12): 2144-2151.
    引用本文: 计忠平 刘利刚 王国瑾. 基于割角的保特征网格简化算法[J]. 计算机研究与发展, 2006, 43(12): 2144-2151.
    Ji Zhongping, Liu Ligang, and Wang Guojin. Feature Preserving Mesh Simplification Based on Corner Cutting[J]. Journal of Computer Research and Development, 2006, 43(12): 2144-2151.
    Citation: Ji Zhongping, Liu Ligang, and Wang Guojin. Feature Preserving Mesh Simplification Based on Corner Cutting[J]. Journal of Computer Research and Development, 2006, 43(12): 2144-2151.

    基于割角的保特征网格简化算法

    Feature Preserving Mesh Simplification Based on Corner Cutting

    • 摘要: 目前存在的网格简化算法大多数在低分辨率下会丢失物体的细节特征.为了改善这点,以割角的方式,以局部体积为简化代价,提出了一种基于半边折叠的新的网格简化算法.与以往算法相比,不仅运行速度快,存储量小,而且非常好地保留了网格的细节特征.除了用于简化网格,也可以对模型构建LOD模型.

       

      Abstract: Most of the existing algorithms for simplifying triangular meshes might lose some important shape features of the original model, especially at low levels of the simplified models. Proposed in this paper is a novel algorithm for triangular mesh simplification, which uses the local volume as the cost of decimation based on edge collapse operators. Many examples demonstrate that the method proposed is fast, requires less memory overhead and preserves the details very well. Furthermore, A set of LOD models by this approach are also easily obtained.

       

    /

    返回文章
    返回