Related papers: Computing confined elasticae
We prove a smooth compactness theorem for the space of elasticae, unless the limit curve is a straight segment. As an application, we obtain smooth stability results for minimizers with respect to clamped boundary data.
We prove localized energy estimates for the wave equation in domains with a strictly concave boundary when homogeneous Dirichlet or Neumann conditions are imposed. By restricting the solution to small, frequency dependent, space time…
We study a class of nonlocal, energy-driven dynamical models that govern the motion of closed, embedded curves from both an energetic and dynamical perspective. Our energetic results provide a variety of ways to understand physically…
A method is given for estimating clamped plane elastica. Arguments are made, and evidence is provided by way of illustrative examples, suggesting that the new method is quicker and more robust than standard discretisation, and more likely…
We propose an efficient method to compute a small set of integer-constrained cone singularities, which induce a rotationally seamless conformal parameterization with low distortion. Since the problem only involves discrete variables, i.e.,…
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 propose numerical schemes for the approximate solution of problems defined on the edges of a one-dimensional graph. In particular, we consider linear transport and a drift-diffusion equations, and discretize them by extending Finite…
Aiming at simulating elastic rods, we discretize a rod model based on a general theory of hyperelasticity for inextensible and unshearable rods. After reviewing this model and discussing topological effects of periodic rods, we prove…
The equations of a planar elastica under pressure can be rewritten in a useful form by parametrising the variables in terms of the local orientation angle, $\theta$, instead of the arc length. This ``$\theta$-formulation'' lends itself to a…
Conventional inverse optimization inputs a solution and finds the parameters of an optimization model that render a given solution optimal. The literature mostly focuses on inferring the objective function in linear problems when accepted…
Constrained Optimization solution algorithms are restricted to point based solutions. In practice, single or multiple objectives must be satisfied, wherein both the objective function and constraints can be non-convex resulting in multiple…
A computation scheme for solving elliptic boundary value problems with axially symmetric confining potentials using different sets of one-parameter basis functions is presented. The efficiency of the proposed symbolic-numerical algorithms…
In this paper we present algorithms for computing the topology of planar and space rational curves defined by a parametrization. The algorithms given here work directly with the parametrization of the curve, and do not require to compute or…
In applications throughout science and engineering one is often faced with the challenge of solving an ill-posed inverse problem, where the number of available measurements is smaller than the dimension of the model to be estimated. However…
We study polygonal analogues of several moving boundary problems and their time discretization which preserves the constant area speed property. We establish various polygonal analogues of geometric formulas for moving boundaries and make…
The geometry of the moduli space of stable spin curves is studied, with emphasis on its combinatorial properties. In this context, the standard graph theoretic framework is not just a book-keeping device: some purely combinatorial results…
This paper is concerned with the computation of an optimal matching between two manifold-valued curves. Curves are seen as elements of an infinite-dimensional manifold and compared using a Riemannian metric that is invariant under the…
This study develops a framework for a class of constant modulus (CM) optimization problems, which covers binary constraints, discrete phase constraints, semi-orthogonal matrix constraints, non-negative semi-orthogonal matrix constraints,…
A common representation of a three dimensional object in computer applications, such as graphics and design, is in the form of a triangular mesh. In many instances, individual or groups of triangles in such representation need to satisfy…
We study the problem of finding the one-dimensional structure in a given data set. In other words we consider ways to approximate a given measure (data) by curves. We consider an objective functional whose minimizers are a regularization of…