Fairing of discrete planar curves by discrete Euler's elasticae

抄録

<p>After characterizing the integrable discrete analogue of the Euler's elastica, we focus our attention on the problem of approximating a given discrete planar curve by an appropriate discrete Euler's elastica. We carry out the fairing process via a $L^2\!$-distance minimization to avoid the numerical instabilities. The optimization problem is solved via a gradient-driven optimization method (IPOPT). This problem is non-convex and the result strongly depends on the initial guess, so that we use a discrete analogue of the algorithm provided by Brander et al., which gives an initial guess to the optimization method.</p>

収録刊行物

  • JSIAM Letters

    JSIAM Letters 11 (0), 73-76, 2019

    一般社団法人 日本応用数理学会

被引用文献 (1)*注記

もっと見る

参考文献 (6)*注記

もっと見る

関連プロジェクト

もっと見る

詳細情報 詳細情報について

問題の指摘

ページトップへ