Related papers: A geometric approach to shortest bounded curvature…
The Dirichlet p-Laplacian in tubes of arbitrary cross-section along infinite curves in Euclidean spaces of arbitrary dimension is investigated. First, it is shown that the gap between the lowest point of the generalised spectrum and the…
In many singular metric spaces, the regularity of a shortest-length curve is unknown. Algebraic varieties, or more generally sets defined by finitely many polynomial or real analytic equalities or inequalities, all locally partition into…
We consider compact connected minimal surfaces, with a pair of boundary curves (not necessarily convex) in distinct planes, that have least-area amongst all orientable surfaces with the same boundary. When the planes containing these two…
We consider a constrained version of the shortest path problem on the complete graphs whose edges have independent random lengths and costs. We establish the asymptotic value of the minimum length as a function of the cost-budget within a…
The Minimum Eccentricity Shortest Path Problem consists in finding a shortest path with minimum eccentricity in a given undirected graph. The problem is known to be NP-complete and W[2]-hard with respect to the desired eccentricity. We…
Using tangent bundle geometry we construct an equivalent reformulation of classical field theory on flat spacetimes which simultaneously encodes the perspectives of multiple observers. Its generalization to curved spacetimes realizes a new…
Probabilistic analysis for metric optimization problems has mostly been conducted on random Euclidean instances, but little is known about metric instances drawn from distributions other than the Euclidean. This motivates our study of…
We consider the problem of enumerating Dyck paths staying weakly above the x-axis with a limit to the number of consecutive up steps, or a limit to the number of consecutive down steps. We use Finite Operator Calculus to obtain formulas for…
Let $s$ be a source point and $t$ be a destination point inside an $n$-vertex simple polygon $P$. Euclidean shortest paths and minimum-link paths between $s$ and $t$ inside $P$ have been well studied. Both these kinds of paths are simple…
Given two points in the plane, and a set of "obstacles" given as curves through the plane with assigned weights, we consider the point-separation problem, which asks for the minimum-weight subset of the obstacles separating the two points.…
We demonstrate a method for exact determination of the quadratic curve of minimal energy and minimal curvature variation through three non-colinear points in the plane, including methods to determine the tangent vector and curvature at any…
In this paper we provide a method of finding possible numbers of shortest paths between two points in a space of compact sets in Euclidean space with Hausdorff distance. We also prove that there cannot be some of the numbers of shortest…
In 1903, noted puzzle-maker Henry Dudeney published The Spider and the Fly puzzle, which asks for the shortest path along the surfaces of a square prism between two points (source and target) located on the square faces, and surprisingly…
In this paper we investigate complex uniruled varieties $X$ whose rational curves of minimal degree satisfy a special property. Namely, we assume that the tangent directions to such curves at a general point $x\in X$ form a linear subspace…
This paper is concerned with determining the shortest path for a pursuer aiming to intercept a moving target travelling at a constant speed. To address this challenge, we introduce an efficient mathematical model outlined as an optimal…
Path planning is crucial for the efficient operation of Autonomous Mobile Robots (AMRs) in factory environments. Many existing algorithms rely on Dubins paths, which have been adapted for various applications. However, an efficient method…
Consider the Lie group of n x n complex unitary matrices U(n) endowed with the bi-invariant Finsler metric given by the spectral norm, ||X||_U = ||U*X||_{sp} = ||X||_{sp} for any X tangent to a unitary operator U. Given two points in U(n),…
Solving the Plateau problem means to find the surface with minimal area among all surfaces with a given boundary. Part of the problem actually consists of giving a suitable definition to the notions of 'surface', 'area' and 'boundary'. The…
We develop an analytic theory of existence and regularity of surfaces (given by graphs) arising from the geometric minimization problem $$\min_{\mathcal{M}}\frac{1}{2}\int_{\mathcal{M}}|\nabla_{\mathcal{M}}H|^2\,dA$$ where $\mathcal{M}$…
Motivated by the classical Euler elastic curves, David A. Singer posed in 1999 the problem of determining a plane curve whose curvature is given in terms of its position. We propound the same question in Lorentz-Minkowski plane, focusing on…