arXiv subjects

Florine Hartwig

Publications and source records attributed to Florine Hartwig.

4 recordsLinked to original sources

arXiv2026

Sub--Riemannian boundary value problems for Optimal Geometric Locomotion

We propose a geometric model for optimal shape-change-induced motions of slender locomotors, e.g., snakes slithering on sand. In these scenarios, the motion of a body in world coordinates is completely determined by the sequence of shapes it assumes. Specifically, we formulate Lagrangian least-dissipation principles as boundary value problems whose solutions are given by sub-Riemannian geodesics. Notably, our geometric model accounts not only for the energy dissipated by the body's displacement through the environment, but also for the energy dissipated by the animal's metabolism or a robot's actuators to induce shape changes such as bending and stretching, thus capturing overall locomotion efficiency. Our continuous model, together with a consistent time and space discretization, enables numerical computation of sub-Riemannian geodesics for three different types of boundary conditions, i.e., fixing initial and target body, restricting to cyclic motion, or solely prescribing body displacement and orientation. The resulting optimal deformation gaits qualitatively match observed motion trajectories of organisms such as snakes and spermatozoa, as well as known optimality results for low-dimensional systems such as Purcell's swimmers. Moreover, being geometrically less rigid than previous frameworks, our model enables new insights into locomotion mechanisms of, e.g., generalized Purcell's swimmers. The code is publicly available.

cs.RO↗

arXiv2025

Geodesic Calculus on Implicitly Defined Latent Manifolds

Latent manifolds of autoencoders provide low-dimensional representations of data, which can be studied from a geometric perspective. We propose to describe these latent manifolds as implicit submanifolds of some ambient latent space. Based on this, we develop tools for a discrete Riemannian calculus approximating classical geometric operators. These tools are robust against inaccuracies of the implicit representation often occurring in practical examples. To obtain a suitable implicit representation, we propose to learn an approximate projection onto the latent manifold by minimizing a denoising objective. This approach is independent of the underlying autoencoder and supports the use of different Riemannian geometries on the latent manifolds. The framework in particular enables the computation of geodesic paths connecting given end points and shooting geodesics via the Riemannian exponential maps on latent manifolds. We evaluate our approach on various autoencoders trained on synthetic and real data.

cs.LG↗

arXiv2025

Discrete Geodesic Calculus in the Space of Sobolev Curves

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 convergence theory. By a slick modification of a temporal Galerkin discretization we manage to preserve coercivity and compactness properties of the continuous model and thereby are able to prove convergence for the geodesic boundary value problem. Likewise, for the numerical analysis of the geodesic initial value problem we are able to exploit the geodesic completeness of the underlying continuous model for the error control of a time-stepping approximation. In fact, we develop a convergent discretization of a comprehensive Riemannian calculus that in addition includes parallel transport, covariant differentiation, the Riemann curvature tensor, and sectional curvature, all important tools to explore the geometry of the space of curves. Selected numerical examples confirm the theoretical findings and show the qualitative behaviour. To this end, a low-dimensional submanifold of Sobolev curves with explicit formulas for ground truth covariant derivatives and curvatures are considered.

math.NA↗

arXiv2025

SDFs from Unoriented Point Clouds using Neural Variational Heat Distances

We propose a novel variational approach for computing neural Signed Distance Fields (SDF) from unoriented point clouds. To this end, we replace the commonly used eikonal equation with the heat method, carrying over to the neural domain what has long been standard practice for computing distances on discrete surfaces. This yields two convex optimization problems for whose solution we employ neural networks: We first compute a neural approximation of the gradients of the unsigned distance field through a small time step of heat flow with weighted point cloud densities as initial data. Then we use it to compute a neural approximation of the SDF. We prove that the underlying variational problems are well-posed. Through numerical experiments, we demonstrate that our method provides state-of-the-art surface reconstruction and consistent SDF gradients. Furthermore, we show in a proof-of-concept that it is accurate enough for solving a PDE on the zero-level set.

math.NA↗