基于L0优化的网格曲面特征线提取算法  

Feature Lines Extraction Algorithm on Meshes Based on L0 Optimization

作　　者：杨贤康 潘茂东 童伟华 YANG Xiankang;PAN Maodong;TONG Weihua(School of Mathematical Sciences,University of Science and Technology of China,Hefei 230026,China)

机构地区：[1]中国科学技术大学数学科学学院

出　　处：《计算机工程》2019年第7期251-257,263,共8页Computer Engineering

基　　金：国家自然科学基金(11571338,61877056);浙江大学CAD&CG国家重点实验室开放课题(A1819)

摘　　要：基于网格曲面特征线的稀疏分布,提出一种优化的特征线提取算法。对于给定的网格,在每个面上计算一个值或向量作为输入。对输入的度量建立 L 0 优化模型,使其在网格边上的跃变尽可能少且优化前后的变化较小。给出基于变量分裂技术与罚函数方法的交替方向优化算法,并引入一种迭代的策略提升解的稀疏性,以取得更高质量的特征线。实验结果表明,该算法能有效提取网格曲面的特征线,与Crest lines算法、变分算法等相比,提高了特征线提取的质量和带噪数据的鲁棒性。Based on the sparse distribution of feature lines on meshes,the paper proposes an optimized algorithm for feature lines extraction.For a given mesh,compute a scalar or a vector for each triangle as the input.Then,an optimized model is established for the measurement of the input so that the jumps on the edge of the meshes are as few as possible and the changes before and after optimization are minimized.An alternating direction optimization algorithm based on variable splitting technique and penalty function approach.In addition,a heuristic strategy is introduced to improve the sparsity of the solution,thus achieving higher quality of feature lines.Experimental results demonstrate that this method can effectively extract feature lines.Compared with some state-of-the-art methods such as Crest lines algorithm,variation algorithm and others,the proposed algorithm can improve the quality of feature lines extraction and the robustness for noisy data.

关 键 词：网格曲面 特征线提取 L0优化 变量分裂 交替方向优化算法 

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