Related papers: Curve Shortening and the Rendezvous Problem for Mo…
Weingarten surfaces are those whose principal curvatures satisfy a functional relation, whose set of solutions is called the curvature diagram or the W-diagram of the surface. Making use of the notion of geometric linear momentum of a plane…
Converting a parametric curve into the implicit form, which is called implicitization, has always been a popular but challenging problem in geometric modeling and related applications. However, the existing methods mostly suffer from the…
We study a general smallest intersecting ball problem and its soft-margin variant in high-dimensional Euclidean spaces for input objects that are compact and convex. These two problems link and unify a series of fundamental problems in…
The proximal gradient algorithm for minimizing the sum of a smooth and a nonsmooth convex function often converges linearly even without strong convexity. One common reason is that a multiple of the step length at each iteration may…
Motivated by mechanical systems with symmetries, we focus on optimal control problems possessing symmetries. Following recent works, which generalized the classical concept of static turnpike to manifold turnpike, we extend the exponential…
A space curve in a Euclidean 3-space $\mathbb E^3$ is called a rectifying curve if its position vector field always lies in its rectifying plane. This notion of rectifying curves was introduced by the author in [Amer. Math. Monthly {\bf…
In this paper, we consider the discrete deformation of the discrete space curves with constant torsion described by the discrete mKdV or the discrete sine-Gordon equations, and show that it is formulated as the torsion-preserving…
The shortest path problem is related to many dynamic processes on networks, ranging from routing in communication networks to signaling in molecular interaction networks. When the network is fully known, the shortest path problem can be…
Given an undirected graph G, the edge orientation problem asks for assigning a direction to each edge to convert G into a directed graph. The aim is to minimize the maximum out degree of a vertex in the resulting directed graph. This…
We present a method for constructing all bounded rational motions that frame a space curve $\mathbf{r}(t)$. This means that the motion guides an orthogonal frame along the curve such that one frame axis is in direction of the curve tangent.…
We prove a variant of the Chance-McDuff conjecture for pseudo-rotations: under certain additional conditions, a closed symplectic manifold which admits a Hamiltonian pseudo-rotation must have deformed quantum product and, in particular,…
The Dirichlet Laplacian in a curved three-dimensional tube built along a spatial (bounded or unbounded) curve is investigated in the limit when the uniform cross-section of the tube diminishes. Both deformations due to bending and twisting…
The freely rotating chain is one of the classic discrete models of a polymer in dilute solution. It consists of a broken line of N straight segments of fixed length such that the angle between adjacent segments is constant and the N-1…
We present a Euclidean quantum gravity model in which random graphs dynamically self-assemble into discrete manifold structures. Concretely, we consider a statistical model driven by a discretisation of the Euclidean Einstein-Hilbert…
Under conditions that prevent tangential intersection, we prove quadratic convergence of a projection algorithm for the feasibility problem of finding a point in the intersection of a smooth curve and line in $\mathbb{R}^2$. This nonconvex…
In a multi-robot system, a number of autonomous robots would sense, communicate, and decide to move within a given domain to achieve a common goal. In this paper, we consider a new variant of the pursuit-evasion problem in which the robots…
In this paper, we propose a Barrett-Garcke-Nurnberg (BGN) method for evolving geometries under general flows and present the corresponding convergence analysis. Specifically, we examine the scenario where a closed curve evolves according to…
Random geometric graphs are random graph models defined on metric measure spaces. A random geometric graph is generated by first sampling points from a metric space and then connecting each pair of sampled points independently with a…
In the formation control problem for autonomous robots a distributed control law steers the robots to the desired target formation. A local stability result of the target formation can be derived by methods of linearization and center…
In this paper, we study a natural discretization of the smooth Gaussian curvature on surfaces, which is defined as the quotient of the angle defect and the area of a geodesic disk at a vertex of a polyhedral surface. It is proved that each…