Related papers: Geodesic distance approximation using a surface fi…
The computation of geodesic distances is an important research topic in Geometry Processing and 3D Shape Analysis as it is a basic component of many methods used in these areas. In this work, we present a minimalistic parallel algorithm…
In this paper, we introduce the notion of "geodesic cover" for Fuchsian groups, which summons copies of fundamental polygons in the hyperbolic plane to cover pairs of representatives realizing distances in the corresponding hyperbolic…
When solving the Poisson equation by the finite element method, we use one degree of freedom for interpolation by the given Laplacian - the right hand side function in the partial differential equation. The finite element solution is the…
A numerical scheme is presented for approximating fractional order Poisson problems in two and three dimensions. The scheme is based on reformulating the original problem posed over $\Omega$ on the extruded domain…
We develop a finite element method for the vector Laplacian based on the covariant derivative of tangential vector fields on surfaces embedded in $\mathbb{R}^3$. Closely related operators arise in models of flow on surfaces as well as…
In this article we study the induced geodesic distance of fractional order Sobolev metrics on the groups of (volume preserving) diffeomorphisms and symplectomorphisms. The interest in these geometries is fueled by the observation that they…
We present a method to approximate pairwise distance on a graph, having an amortized sub-linear complexity in its size. The proposed method follows the so called heat method due to Crane et al. The only additional input are the values of…
We present a computational scheme that derives a global polynomial level set parametrisation for smooth closed surfaces from a regular surface-point set and prove its uniqueness. This enables us to approximate a broad class of smooth…
We present GeGnn, a learning-based method for computing the approximate geodesic distance between two arbitrary points on discrete polyhedra surfaces with constant time complexity after fast precomputation. Previous relevant methods either…
This paper proposes a geodesic-distance-based feature that encodes global information for improved video segmentation algorithms. The feature is a joint histogram of intensity and geodesic distances, where the geodesic distances are…
We revisit two NP-hard geometric partitioning problems - convex decomposition and surface approximation. Building on recent developments in geometric separators, we present quasi-polynomial time algorithms for these problems with improved…
Several important algorithms for machine learning and data analysis use pairwise distances as input. On Riemannian manifolds these distances may be prohibitively costly to compute, in particular for large datasets. To tackle this problem,…
In this paper we analyze a space-time unfitted finite element method for the discretization of scalar surface partial differential equations on evolving surfaces. For higher order approximations of the evolving surface we use the technique…
We consider a diffuse interface approach for solving an elliptic PDE on a given closed hypersurface. The method is based on a (bulk) finite element scheme employing numerical quadrature for the phase field function and hence is very easy to…
A complete treatment of the intersections of two geodesics on the surface of an ellipsoid of revolution is given. With a suitable metric for the distances between intersections, bounds are placed on their spacing. This leads to fast and…
This review examines progress on the Pop I, fundamental-mode Cepheid distance scale with emphasis on recent developments in geometric and quasi-geometric techniques for Cepheid distance determination. Specifically I examine the surface…
A suitable measure for the similarity of shapes represented by parameterized curves or surfaces is the Fr\'echet distance. Whereas efficient algorithms are known for computing the Fr\'echet distance of polygonal curves, the same problem for…
The $\mathcal{G}_I^0$ distribution is able to characterize different regions in monopolarized SAR imagery. It is indexed by three parameters: the number of looks (which can be estimated in the whole image), a scale parameter and a texture…
In this work, the geodesic equations and their numerical solution in Cartesian coordinates on an oblate spheroid, presented by Panou and Korakitis (2017), are generalized on a triaxial ellipsoid. A new exact analytical method and a new…
Chamfer Distance (CD) is a widely adopted metric in 3D point cloud learning due to its simplicity and efficiency. However, it suffers from a fundamental limitation: it relies solely on Euclidean distances, which often fail to capture the…