Related papers: Geodesic distance approximation using a surface fi…
Geodesic paths and distances are among the most popular intrinsic properties of 3D surfaces. Traditionally, geodesic paths on discrete polygon surfaces were computed using shortest path algorithms, such as Dijkstra. However, such algorithms…
In this paper we consider a class of unfitted finite element methods for discretization of partial differential equations on surfaces. In this class of methods known as the Trace Finite Element Method (TraceFEM), restrictions or traces of…
We give bounds on geodesic distances on the Stiefel manifold, derived from new geometric insights. The considered geodesic distances are induced by the one-parameter family of Riemannian metrics introduced by H\"uper et al. (2021), which…
Given a simple polygon $P$ and a set $Q$ of points contained in $P$, we consider the geodesic $k$-center problem where we want to find $k$ points, called \emph{centers}, in $P$ to minimize the maximum geodesic distance of any point of $Q$…
In this paper, we consider enumeration of geodesics on a polyhedron, where a geodesic means locally-shortest path between two points. Particularly, we consider the following preprocessing problem: given a point $s$ on a polyhedral surface…
We derive computable error estimates for finite element approximations of linear elliptic partial differential equations (PDE) with rough stochastic coefficients. In this setting, the exact solutions contain high frequency content that…
This work focuses on a phase field approximation of Plateau's problem. Inspired by Reifenberg's point of view, we introduce a model that combines the Ambrosio-Torterelli energy with a geodesic distance term, which can be considered as a…
A standard way to approximate the distance between any two vertices $p$ and $q$ on a mesh is to compute, in the associated graph, a shortest path from $p$ to $q$ that goes through one of $k$ sources, which are well-chosen vertices.…
Recently, a nonconforming surface finite element was developed to discretize 3d vector-valued compressible flow problems arising in climate modeling. In this contribution we derive an error analysis for this approach on a vector-valued…
Over the past few years, symmetric positive definite (SPD) matrices have been receiving considerable attention from computer vision community. Though various distance measures have been proposed in the past for comparing SPD matrices, the…
In this paper, we define new unfitted finite element methods for numerically approximating the solution of surface partial differential equations using bulk finite elements. The key idea is that the $n$-dimensional hypersurface, $\Gamma…
We develop all of the components needed to construct an adaptive finite element code that can be used to approximate fractional partial differential equations, on non-trivial domains in $d\geq 1$ dimensions. Our main approach consists of…
The Fr\'echet distance is a popular similarity measure that is well-understood for polygonal curves in $\mathbb{R}^d$: near-quadratic time algorithms exist, and conditional lower bounds suggest that these results cannot be improved…
We establish the equivalence between the regularity (rectifiability) of sets and suitable estimates on the oscillation of the gradient for smooth non-local distance functions. A prototypical example of such a distance was introduced, as…
Suppose that the surfaces K0 and Kr are the boundaries of two convex, complete, connected C^2 bodies in R^3. Assume further that the (Euclidean) distance between any point x in Kr and K0 is always r (r > 0). For x in Kr, let {\Pi}(x) denote…
Distance plays a fundamental role in measuring similarity between objects. Various visualization techniques and learning tasks in statistics and machine learning such as shape matching, classification, dimension reduction and clustering…
This paper is concerned with finite element approximations of $W^{2,p}$ strong solutions of second-order linear elliptic partial differential equations (PDEs) in non-divergence form with continuous coefficients. A nonstandard (primal)…
This paper derives some discrete maximum principles for $P1$-conforming finite element approximations for quasi-linear second order elliptic equations. The results are extensions of the classical maximum principles in the theory of partial…
The closest point method (Ruuth and Merriman, J. Comput. Phys. 227(3):1943-1961, [2008]) is an embedding method developed to solve a variety of partial differential equations (PDEs) on smooth surfaces, using a closest point representation…
We present a new $hp$-version space-time discontinuous Galerkin (dG) finite element method for the numerical approximation of parabolic evolution equations on general spatial meshes consisting of polygonal/polyhedral (polytopic) elements,…