Related papers: Geodesics on Grushin spaces
The equations governing null and timelike geodesics are derived within the 3+1 formalism of general relativity. In addition to the particle's position, they encompass an evolution equation for the particle's energy leading to a 3+1…
A recent generalisation of the Raychaudhuri equations for timelike geodesic congruences to families of $D$ dimensional extremal, timelike, Nambu--Goto surfaces embedded in an $N$ dimensional Lorentzian background is reviewed. Specialising…
In this paper, we aim to develop a hybridizable discontinuous Galerkin (HDG) method for the indefinite time-harmonic Maxwell equations with the perfectly conducting boundary in the three-dimensional space. First, we derive the wavenumber…
A complete treatment of the intersections of two geodesics on the surface of an ellipsoid of revolution is given. With a suitable metric for the distances between intersections, bounds are placed on their spacing. This leads to fast and…
Starting from a Lagrangian we perform the full constraint analysis of the Hamiltonian for General relativity in the tetrad-connection formulation for an arbitrary value of the Immirzi parameter and solve the second class constraints,…
We consider the topological and geometric reconstruction of a geodesic subspace of $\mathbb{R}^N$ both from the \v{C}ech and Vietoris-Rips filtrations on a finite, Hausdorff-close, Euclidean sample. Our reconstruction technique leverages…
Algorithms for the computation of the forward and inverse geodesic problems for an ellipsoid of revolution are derived. These are accurate to better than 15 nm when applied to the terrestrial ellipsoids. The solutions of other problems…
The Gardiner-Masur compactification of Teichm\"uller space is homeomorphic to the horofunction compactification of the Teichm\"uller metric. Let $\xi$ and $\eta$ be a pair of boundary points in the Gardiner-Masur compactification that fill…
In this paper, we present our heuristic solutions to the problems of finding the maximum and minimum area polygons with a given set of vertices. Our solutions are based mostly on two simple algorithmic paradigms: greedy method and local…
This paper presents a unified geometric framework for the statistical analysis of a general ill-posed linear inverse model which includes as special cases noisy compressed sensing, sign vector recovery, trace regression, orthogonal matrix…
In addition to the theoretical value of challenging optimal control problmes, recent progress in autonomous vehicles mandates further research in optimal motion planning for wheeled vehicles. Since current numerical optimal control…
Machine learning has been progressively generalised to operate within non-Euclidean domains, but geometrically accurate methods for learning on surfaces are still falling behind. The lack of closed-form Riemannian operators, the…
The aim of this paper is to establish a theory of Galerkin approximations to the space of convex and compact subsets of $\R^d$ with favorable properties, both from a theoretical and from a computational perspective. These Galerkin spaces…
The global time is defined in covariant form under the condition of a constant mean curvature slicing of spacetime. The background static metric is taken in the tangent space. The global intrinsic time is identified with the logarithmic…
This paper is motivated by the limit load, limit analysis and shear strength reduction methods, which are commonly employed in geotechnical stability analysis or similar applications. The aim is to make these methods more approachable by…
In this paper we study 1/k-geodesics, those closed geodesics that minimize on any subinterval of length $l(\gamma)/k$. We employ energy methods to provide a relationship between the 1/k-geodesics and what we define as the balanced points of…
We establish sharp universal upper bounds on the length of the shortest closed geodesic on a punctured sphere with three or four ends endowed with a complete Riemannian metric of finite area. These sharp curvature-free upper bounds are…
In this PhD thesis, we give a new geometric approach to higher Teichm\"uller theory. In particular we construct a geometric structure on surfaces, generalizing the complex structure, and we explore its link to Hitchin components. The…
Clustering is one of the most fundamental tools in data science and machine learning, and k-means clustering is one of the most common such methods. There is a variety of approximate algorithms for the k-means problem, but computing the…
We prove existence and uniqueness of the minimizer for the average geodesic distance to the points of a geodesically convex set on the sphere. This implies a corresponding existence and uniqueness result for an optimal algorithm for…