Fairing of Discrete Planar Curves by Discrete Euler’s Elasticae

Sebastián Elías Graiff Zurita, Kenji Kajiwara

Research output: Contribution to journalArticlepeer-review


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 L2-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.

Original languageEnglish
JournalUnknown Journal
Publication statusPublished - Nov 11 2019

All Science Journal Classification (ASJC) codes

  • General

Fingerprint Dive into the research topics of 'Fairing of Discrete Planar Curves by Discrete Euler’s Elasticae'. Together they form a unique fingerprint.

Cite this