高级检索
王士玮, 刘利刚, 张举勇, 杨周旺, 董光昌. 基于稀疏模型的曲线光顺算法[J]. 计算机辅助设计与图形学学报, 2016, 28(12): 2043-2051.
引用本文: 王士玮, 刘利刚, 张举勇, 杨周旺, 董光昌. 基于稀疏模型的曲线光顺算法[J]. 计算机辅助设计与图形学学报, 2016, 28(12): 2043-2051.
Wang Shiwei, Liu Ligang, Zhang Juyong, Yang Zhouwang, Dong Guangchang. Sparity Optimization Based Curve Fairing[J]. Journal of Computer-Aided Design & Computer Graphics, 2016, 28(12): 2043-2051.
Citation: Wang Shiwei, Liu Ligang, Zhang Juyong, Yang Zhouwang, Dong Guangchang. Sparity Optimization Based Curve Fairing[J]. Journal of Computer-Aided Design & Computer Graphics, 2016, 28(12): 2043-2051.

基于稀疏模型的曲线光顺算法

Sparity Optimization Based Curve Fairing

  • 摘要: 为了对曲线进行有效光顺,将曲线光顺问题建模成基于稀疏模型的优化问题,并提出了新的曲线光顺算法.通过分析非光顺曲线的例子,对现有的判别准则进行了总结;根据总结出的判别准则,曲线的光顺性与曲率图二阶差分的稀疏性与大小密切相关,将曲线光顺问题建模成一种基于稀疏模型的优化问题;并给出了一种高效的迭代调整算法求解该模型.数值实验结果表明,文中算法是实用和有效的;与其他光顺算法进行对比时,该算法也有十分突出的表现.

     

    Abstract: In this paper we propose a sparse modeling based optimization method to formulate the curve fairness problem. Based on an overall review on previous fairness criteria and our comprehensive working experience on ship design, our proposed fairness criteria not only covers all the previous cases but also considers cases which are never studied before. The curve fairness problem is further formulated as a sparse modeling based optimization problem according to our proposed criteria. An effective and efficient iterative refinement algorithm is proposed. Numerous experimental results demonstrate the practicability and effectiveness of our fairing algorithm, and the comparisons show that our fairing algorithm outperforms the state of the art curve fairness methods.

     

/

返回文章
返回