Related papers: Curve Shortening and the Rendezvous Problem for Mo…
In this work we compare two fundamentally different approaches to the electronic transport in deformed graphene: a) the condensed matter approach in which current flow paths are obtained by applying the non-equilibrium Green's function…
We develop the concept of Cartan ribbons together with a rolling-based method to ribbonize and approximate any given surface in space by intrinsically flat ribbons. The rolling requires that the geodesic curvature along the contact curve on…
Nonconvex optimization underlies many modern machine learning and control tasks, where saddle points pose the dominant obstacle to reliable convergence in high-dimensional settings. Escaping these saddle points deterministically using…
A nonlocal curvature flow is introduced to evolve locally convex curves in the plane. It is proved that this flow with any initial locally convex curve has a global solution, keeping the local convexity and the elastic energy of the…
In many robot motion planning problems, task objectives and physical constraints induce non-Euclidean geometry on the configuration space, yet many planners operate using Euclidean distances that ignore this structure. We address the…
This paper deals with the study of some properties of immersed curves in the conformal sphere $\mathds{Q}_n$, viewed as a homogeneous space under the action of the M\"obius group. After an overview on general well-known facts, we briefly…
The U-curve optimization problem is characterized by a decomposable in U-shaped curves cost function over the chains of a Boolean lattice. This problem can be applied to model the classical feature selection problem in Machine Learning.…
We investigate the evolution of axis ratios, roundness (isoperimetric ratio) and the number of static balance points under distance-driven flows. The latter have already been proposed by Aristotle as models of particle shape evolution and…
In this paper we study the isomonodromic deformations of systems of differential equations with poles of any order on the Riemann sphere as Hamiltonian flows on the product of co-adjoint orbits of the Takiff algebra (i.e. truncated current…
A simple mapping procedure is presented by which classical orbits and path integrals for the motion of a point particle in flat space can be transformed directly into those in curved space with torsion. Our procedure evolved from…
We study the convergence properties of a collapsed Gibbs sampler for Bayesian vector autoregressions with predictors, or exogenous variables. The Markov chain generated by our algorithm is shown to be geometrically ergodic regardless of…
We consider Calderon's inverse problem with partial data in dimensions $n \geq 3$. If the inaccessible part of the boundary satisfies a (conformal) flatness condition in one direction, we show that this problem reduces to the invertibility…
A path-following control algorithm enables a system's trajectories under its guidance to converge to and evolve along a given geometric desired path. There exist various such algorithms, but many of them can only guarantee local convergence…
A connection between the dynamics of a sine-Gordon chain and a certain static membrane folding problem was recently found. The one-dimensional membrane profile is a cross-section of the position-time sine-Gordon amplitude profile. Here we…
A generalization of the random geometric graph (RGG) model is proposed by considering a set of points uniformly and independently distributed on a rectangle of unit area instead of on a unit square [0,1]^2. The topological properties of the…
We study the smallest intersecting and enclosing ball problems in Euclidean spaces for input objects that are compact and convex. They link and unify many problems in computational geometry and machine learning. We show that both problems…
Let (E,D,P) be a flat vector bundle with a parabolic structure over a punctured Riemann surface, (M,g). We consider a deformation of the harmonic metric equation which we call the Poisson metric equation. This equation arises naturally as…
This paper proposes a simple technique of curve and surface construction with B-splines. Given a control polygon or a control mesh together with node ordinates corresponding to all control points, a rational curve or surface is obtained by…
Numerical computation of shortest paths or geodesics on curved domains, as well as the associated geodesic distance, arises in a broad range of applications across digital geometry processing, scientific computing, computer graphics, and…
We study shortest curves in proximally smooth subsets of a Hilbert space. We consider an $R$-proximally smooth set $A$ in a Hilbert space with points $a$ and $b$ satisfying $\left|{a-b}\right| < 2R.$ We provide a simple geometric algorithm…