Related papers: Geodesic distance approximation using a surface fi…
The Gromov-Hausdorff (GH) distance is traditionally used for measuring distances between metric spaces. It is defined as the minimal distortion of embedding one surface into the other, while the optimal correspondence can be described as…
We construct a surface that is obtained from the octahedron by pushing out 4 of the faces so that the curvature is supported in a copy of the Sierpinski gasket in each of them, and is essentially the self similar measure on SG. We then…
There are many numerical methods for solving partial different equations (PDEs) on manifolds such as classical implicit, finite difference, finite element, and isogeometric analysis methods which aim at improving the interoperability…
We give an accessible introduction and elaboration on the methods used in obtaining a geodesic, which is the curve of shortest length connecting two points lying on the surface of a function. This is found through computing what's known as…
Subdivision surfaces are proven to be a powerful tool in geometric modeling and computer graphics, due to the great flexibility they offer in capturing irregular topologies. This paper discusses the robust and efficient implementation of an…
We consider the distance function from an arbitrary point $p$ on a flat surface, and determine the set $F_{p}$ of all \emph{farthest points} (i.e., points at maximal distance) from $p$.
A set of piecewise linear functions, called polylines, $P_1,\ldots,P_L$ each with at most $n$ vertices can be simplified into a polyline $M$ with $k$ vertices, such that the Fr\'echet distances $\epsilon_1,\ldots,\epsilon_L$ to each of…
We present a continuous finite element method for some examples of fully nonlinear elliptic equation. A key tool is the discretisation proposed in Lakkis & Pryer (2011, SISC) allowing us to work directly on the strong form of a linear PDE.…
We introduce a method-of-lines formulation of the closest point method, a numerical technique for solving partial differential equations (PDEs) defined on surfaces. This is an embedding method, which uses an implicit representation of the…
Learning a distance function or metric on a given data manifold is of great importance in machine learning and pattern recognition. Many of the previous works first embed the manifold to Euclidean space and then learn the distance function.…
Partial differential equations can be used for extracting geometric features of shapes. This article summarizes recent methods to extract the normal vector field from an elliptic equation proposed by Yamada and from the heat equation, and…
We propose a general convex optimization problem for computing regularized geodesic distances. We show that under mild conditions on the regularizer the problem is well posed. We propose three different regularizers and provide analytical…
We present a general purpose method for solving partial differential equations on a closed surface, based on a technique for discretizing the surface introduced by Wenjun Ying and Wei-Cheng Wang [J. Comput. Phys. 252 (2013), pp. 606-624]…
In this paper, we study the distance problem in the setting of finite p-adic rings. In odd dimensions, our results are essentially sharp. In even dimensions, we clarify the conjecture and provide examples to support it. Surprisingly,…
Numerical computation of shortest paths or geodesics on curved domains, as well as the associated geodesic distance, arises in a broad range of applications across digital geometry processing, scientific computing, computer graphics, and…
In this paper we consider the numerical approximation of the incompressible surface Navier--Stokes equations on an evolving surface. For the discrete representation of the moving surface we use parametric finite elements of degree $\ell…
We mainly investigate some properties of quasiconformal mappings between smooth 2-dimensional surfaces with boundary in the Euclidean space, satisfying certain partial differential equations (inequalities) concerning Laplacian, and in…
In this paper, we propose a novel meshfree Generalized Finite Difference Method (GFDM) approach to discretize PDEs defined on manifolds. Derivative approximations for the same are done directly on the tangent space, in a manner that mimics…
In this paper, we study the characterization of geodesics for a class of distances between probability measures introduced by Dolbeault, Nazaret and Savar e. We first prove the existence of a potential function and then give necessary and…
In this paper, we propose an adaptive finite element method for computing the first eigenpair of the $p$-Laplacian problem. We prove that starting from a fine initial mesh our proposed adaptive algorithm produces a sequence of discrete…