相关论文: Projective Reeds-Shepp car on $S^2$ with quadratic…

In order to detect salient lines in spherical images, we consider the problem of minimizing the functional $\int \limits_0^l C(\gamma(s)) \sqrt{\xi^2 + k_g^2(s)} \, {\rm d}s$ for a curve $\gamma$ on a sphere with fixed boundary points and…

We present a PDE-based approach for finding optimal paths for the Reeds-Shepp car. In our model we minimize a (data-driven) functional involving both curvature and length penalization, with several generalizations. Our approach encompasses…

We consider the problem of minimizing $\int_{0}^L \sqrt{\xi^2 +K^2(s)}\, ds $ for a planar curve having fixed initial and final positions and directions. The total length $L$ is free. Here $s$ is the variable of arclength parametrization,…

Given a `cost' functional $F$ on paths $\gamma$ in a domain $D\subset\mathbb{R}^d$, in the form $F(\gamma) = \int_0^1 f(\gamma(t),\dot\gamma(t))dt$, it is of interest to approximate its minimum cost and geodesic paths. Let $X_1,\ldots, X_n$…

We introduce a convergent finite difference method for solving the optimal transportation problem on the sphere. The method applies to both the traditional squared geodesic cost (arising in mesh generation) and a logarithmic cost (arising…

We address the problem of fitting parametric curves on the Grassmann manifold for the purpose of intrinsic parametric regression. As customary in the literature, we start from the energy minimization formulation of linear least-squares in…

The problem of finding minimizing geodesics for a manifold M with a sub-Riemannian structure is equivalent to the time optimal control of a driftless system on M with a bound on the control. We consider here a class of sub-Riemannian…

This article presents a mathematical analysis and numerical strategies for solving the optimization problem of minimizing the quadratic function $J(P) = \text{Tr}(BP)- \frac{1}{2} \text{Tr}(A P A P)$, where $A,B \in \mathbb R^{M \times…

We explicitly describe the length minimizing geodesics for a sub-Riemannian structure of the elliptic type defined on $SL(2, \mathbb{R})$. Our method uses a symmetry reduction which translates the problem into a Riemannian problem on a two…

Let G=(V,E)(|V|=n and |E|=m) be an undirected graph with positive edge weights. Let P_{G}(s, t) be a shortest s-t path in G. Let l be the number of edges in P_{G}(s, t). The \emph{Edge Replacement Path} problem is to compute a shortest s-t…

In this article, we consider the Euclidean dispersion problems. Let $P=\{p_{1}, p_{2}, \ldots, p_{n}\}$ be a set of $n$ points in $\mathbb{R}^2$. For each point $p \in P$ and $S \subseteq P$, we define $cost_{\gamma}(p,S)$ as the sum of…

The quadratic shortest path problem (QSPP) is \textcolor{black}{the problem of finding a path with prespecified start vertex $s$ and end vertex $t$ in a digraph} such that the sum of weights of arcs and the sum of interaction costs over all…

Building on the results of Ma, Trudinger and Wang \cite{MTW}, and of the author \cite{L5}, we study two problems of optimal transportation on the sphere: the first corresponds to the cost function $d^2(x,y)$, where $d(\cdot,\cdot)$ is the…

We consider the problem $\mathbf{P_{curve}}$ of minimizing $\int \limits_0^L \sqrt{\xi^2 + \kappa^2(s)} \, {\rm d}s$ for a curve $\mathbf{x}$ on $\mathbb R$ with fixed boundary points and directions. Here the total length $L\geq 0$ is free,…

The parametric global minimum cut problem concerns a graph $G = (V,E)$ where the cost of each edge is an affine function of a parameter $\mu \in \mathbb{R}^d$ for some fixed dimension $d$. We consider the problems of finding the next…

Short geodesics are important in the study of the geometry and the spectra of Riemann surfaces. Bers' theorem gives a global bound on the length of the first $3g-3$ geodesics. We use the construction of Brooks and Makover of random Riemann…

The Riemannian manifold of curves with a Sobolev metric is an important and frequently studied model in the theory of shape spaces. Various numerical approaches have been proposed to compute geodesics, but so far elude a rigorous…

We describe algorithms to efficiently compute minimum $(s,t)$-cuts and global minimum cuts of undirected surface-embedded graphs. Given an edge-weighted undirected graph $G$ with $n$ vertices embedded on an orientable surface of genus $g$,…

Given an undirected graph $G=(V,E)$ with positive edge lengths and two vertices $s$ and $t$, the next-to-shortest path problem is to find an $st$-path which length is minimum amongst all $st$-paths strictly longer than the shortest path…

Given a smooth Riemannian manifold $(M,g)$, compact and without boundary, we analyze the dynamical optimal mass transport problem where the cost is given by the sum of the kinetic energy and the relative entropy with respect to a reference…