Related papers: Fairing of Discrete Planar Curves by Integrable Di…
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…
Euler's elastica is a classical model of flexible slender structures, relevant in many industrial applications. Static equilibrium equations can be derived via a variational principle. The accurate approximation of solutions of this problem…
We give an algorithm for approximating a given plane curve segment by a planar elastic curve. The method depends on an analytic representation of the space of elastic curve segments, together with a geometric method for obtaining a good…
We consider the problem of minimizing Euler's elastica energy for simple closed curves confined to the unit disk. We approximate a simple closed curve by the zero level set of a function with values +1 on the inside and -1 on the outside of…
In this paper, we consider a class of plane curves called log-aesthetic curves and their generalization which are used in computer aided geometric design. We consider these curves in the framework of the similarity geometry and characterize…
This paper introduces a new mathematical formulation and numerical approach for the computation of distances and geodesics between immersed planar curves. Our approach combines the general simplifying transform for first-order elastic…
We present an algorithm to fair a given planar curve by a log-aesthetic curve (LAC). We show how a general LAC segment can be uniquely characterized by seven parameters and present a method of parametric approximation based on this fact.…
An interior penalty discontinuous Galerkin method is devised to approximate minimizers of a linear folding model by discontinuous isoparametric finite element functions that account for an approximation of a folding arc. The numerical…
This paper concerns an optimization algorithm for unconstrained non-convex problems where the objective function has sparse connections between the unknowns. The algorithm is based on applying a dissipation preserving numerical integrator,…
We propose a modification of the standard linear implicit Euler integrator for the weak approximation of parabolic semilinear stochastic PDEs driven by additive space-time white noise. The new method can easily be combined with a finite…
We propose a notion of discrete elastic and area-constrained elastic curves in 2-dimensional space forms. Our definition extends the well-known discrete Euclidean curvature equation to space forms and reflects various geometric properties…
We investigate the equilibrium configurations of closed planar elastic curves of fixed length, whose stiffness, also known as the bending rigidity, depends on an additional density variable. The underlying variational model relies on the…
The aim of this paper is to find an optimal matching between manifold-valued curves, and thereby adequately compare their shapes, seen as equivalent classes with respect to the action of reparameterization. Using a canonical decomposition…
We provide statistical analysis methods for samples of curves when the image but not the parametrisation of the curves is of interest. A parametrisation invariant analysis can be based on the elastic distance of the curves modulo warping,…
We study variational problems for curves approximated by B-spline curves. We show that, one can obtain discrete Euler-Lagrange equations, for the data describing the approximated curves. Our main application is to the curve completion…
In this paper, we study unirational differential curves and the corresponding differential rational parametrizations. We first investigate basic properties of proper differential rational parametrizations for unirational differential…
We study the problem of identifying those cubic B\'ezier curves that are close in the L2 norm to planar elastic curves. The problem arises in design situations where the manufacturing process produces elastic curves; these are difficult to…
We present a certified algorithm based on subdivision for computing an isotopic approximation to any number of curves in the plane. Our algorithm is based on the certified curve approximation algorithm of Plantinga and Vegter. The main…
We present a certified algorithm based on subdivision for computing an isotopic approximation to any number of curves in the plane. Our algorithm is based on the certified curve approximation algorithm of Plantinga and Vegter. The main…
Euler's elastica model has a wide range of applications in Image Processing and Computer Vision. However, the non-convexity, the non-smoothness and the nonlinearity of the associated energy functional make its minimization a challenging…