Related papers: Averaging geometrical objects on a differentiable …

The theory of frames normal for general connections on differentiable bundles is developed. Links with the existing theory of frames normal for covariant derivative operators (linear connections) in vector bundles are revealed. The…

The analysis of manifold-valued data requires efficient tools from Riemannian geometry to cope with the computational complexity at stake. This complexity arises from the always-increasing dimension of the data, and the absence of…

We study diffusion processes and stochastic flows which are time-changed random perturbations of a deterministic flow on a manifold. Using non-symmetric Dirichlet forms and their convergence in a sense close to the Mosco-convergence, we…

Solving the so-called geodesic endpoint problem, i.e., finding a geodesic that connects two given points on a manifold, is at the basis of virtually all data processing operations, including averaging, clustering, interpolation and…

Lagrange geometry is the geometry of the tensor field defined by the fiberwise Hessian of a non degenerate Lagrangian function on the total space of a tangent bundle. Finsler geometry is the geometrically most interesting case of Lagrange…

We provide a complete geometric solution to the problem of differentiating simplicial manifolds, extending classical Lie theory and complementing existing homotopical and formal approaches within a unifying framework. First, we establish a…

We consider the continuous Fermat-Weber problem, where the customers are continuously (uniformly) distributed along the boundary of a convex polygon. We derive the closed-form expression for finding the average distance from a given point…

We develop an invariant local theory of Lorentz surfaces in pseudo-Euclidean 4-space by use of a linear map of Weingarten type. We find a geometrically determined moving frame field at each point of the surface and obtain a system of…

The second fundamental form of Riemannian geometry is generalised to the case of a manifold with a linear connection and an integrable distribution. This bilinear form is generally not symmetric and its skew part is the torsion. The form…

Geometric torsions are torsions of acyclic complexes of vector spaces which consist of differentials of geometric quantities assigned to the elements of a manifold triangulation. We use geometric torsions to construct invariants for a…

If M is a smooth compact connected Riemannian manifold, let P(M) denote the Wasserstein space of probability measures on M. We describe a geometric construction of parallel transport of some tangent cones along geodesics in P(M). We show…

In the last two decades, much effort has been dedicated to studying curves and surfaces according to their angle with a given direction. However, most findings were obtained using a case-by-case approach, and it is often unclear what are…

The equivalence of a conformal metric on 4-dimensional space-time and a local field of 3-dimensional subspaces of the space of 2-forms over space-time is discussed and the basic notion of transection is introduced. Corresponding relation is…

We study the ergodic properties of generic continuous dynamical systems on compact manifolds. As a main result we prove that generic homeomorphisms have convergent Birkhoff averages under continuous observables at Lebesgue almost every…

We consider surfaces embedded in a Riemannian manifold of arbitrary dimension and prove that many aspects of their differential geometry can be expressed in terms of a Poisson algebraic structure on the space of smooth functions of the…

Transversal structures (also known as regular edge labelings) are combinatorial structures defined over 4-connected plane triangulations with quadrangular outer-face. They have been intensively studied and used for many applications…

This paper lays the foundations for a unified framework for numerically and computationally applying methods drawn from a range of currently distinct geometrical approaches to statistical modelling. In so doing, it extends information…

A geometric graph is a graph embedded in the plane with vertices at points and edges drawn as curves (which are usually straight line segments) between those points. The average transversal complexity of a geometric graph is the number of…

One may associate several frames to a given polytope, such as its collection of vertices, edges, or facet normal vectors. In this note, we use these frames to generate geometric inequalities for the simplex in $\mathbb{R}^d$ and polytopes…

Consensus algorithms are popular distributed algorithms for computing aggregate quantities, such as averages, in ad-hoc wireless networks. However, existing algorithms mostly address the case where the measurements lie in a Euclidean space.…