Related papers: Geodesic distance approximation using a surface fi…
The length of the geodesic between two data points along a Riemannian manifold, induced by a deep generative model, yields a principled measure of similarity. Current approaches are limited to low-dimensional latent spaces, due to the…
Let $V$ be a separable Hilbert space, possibly infinite dimensional. Let $\St(p,V)$ be the Stiefel manifold of orthonormal frames of $p$ vectors in $V$, and let $\Gr(p,V)$ be the Grassmann manifold of $p$ dimensional subspaces of $V$. We…
In this paper a class of higher order finite element methods for the discretization of surface Stokes equations is studied. These methods are based on an unfitted finite element approach in which standard Taylor-Hood spaces on an underlying…
This paper shows how to use the shooting method, a classical numerical algorithm for solving boundary value problems, to compute the Riemannian distance on the Stiefel manifold $ \mathrm{St}(n,p) $, the set of $ n \times p $ matrices with…
Partial differential equations (PDEs) on surfaces arise in a wide range of applications. The closest point method (Ruuth and Merriman, J. Comput. Phys. 227(3):1943-1961, [2008]) is a recent embedding method that has been used to solve a…
We propose a novel type of planar-to-spatial deployable structures that we call elastic geodesic grids. Our approach aims at the approximation of freeform surfaces with spatial grids of bent lamellas which can be deployed from a planar…
In the square root velocity framework, the computation of shape space distances and the registration of curves requires solution of a non-convex variational problem. In this paper, we present a new PDE-based method for solving this problem…
We introduce a surface finite element method for the numerical solution of Navier-Stokes equations on evolving surfaces with a prescribed deformation of the surface in normal direction. The method is based on approaches for the full surface…
We consider the isogeometric analysis for fractional PDEs involving the fractional Laplacian in two dimensions. An isogeometric collocation method is developed to discretize the fractional Laplacian and applied to the fractional Poisson…
Finding the point in an algebraic variety that is closest to a given point is an optimization problem with many applications. We study the case when the variety is a Fermat hypersurface. Our formula for its Euclidean distance degree is a…
Computing intrinsic distances on discrete surfaces is at the heart of many minimization problems in geometry processing and beyond. Solving these problems is extremely challenging as it demands the computation of on-surface distances along…
Minimization of energy functionals is based on a discretization by the finite element method and optimization by the trust-region method. A key tool is a local evaluation of the approximated gradients together with sparsity of the resulting…
This paper surveys recent numerical advances in the phase field method for geometric surface evolution and related geometric nonlinear partial differential equations (PDEs). Instead of describing technical details of various numerical…
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 paper studies a finite element method for computing transport and diffusion along evolving surfaces. The method does not require a parametrization of a surface or an extension of a PDE from a surface into a bulk outer domain. The…
This paper is concerned with the nonconforming finite element discretization of geometric partial differential equations. In specific, we construct a surface Crouzeix-Raviart element on the linear approximated surface, analogous to a flat…
We describe the implementation of a topological constraint in finite element simulations of phase field models which ensures path-connectedness of preimages of intervals in the phase field variable. Two main applications of our method are…
Spatial approximations have been traditionally used in spatial databases to accelerate the processing of complex geometric operations. However, approximations are typically only used in a first filtering step to determine a set of candidate…
In this work, we investigate the problem of learning distance functions within the query-based learning framework, where a learner is able to pose triplet queries of the form: ``Is $x_i$ closer to $x_j$ or $x_k$?'' We establish formal…
Riemann surfaces are among the simplest and most basic geometric objects. They appear as key players in many branches of physics, mathematics, and other sciences. Despite their widespread significance, how to compute distances between pairs…