Related papers: A square root velocity framework for curves of bou…
We introduce a variational approach for extracting curves between a list of possible endpoints, based on the discretization of an energy and Smirnov's decomposition theorem for vector fields. It is used to design a bi-level minimization…
Metric graphs are ubiquitous in science and engineering. For example, many data are drawn from hidden spaces that are graph-like, such as the cosmic web. A metric graph offers one of the simplest yet still meaningful ways to represent the…
This work builds a unified framework for the study of quadratic form distance measures as they are used in assessing the goodness of fit of models. Many important procedures have this structure, but the theory for these methods is dispersed…
We study the concept of the continuous mean distance of a weighted graph. For connected unweighted graphs, the mean distance can be defined as the arithmetic mean of the distances between all pairs of vertices. This parameter provides a…
Planar curves with periodically varying curvature arise in the natural sciences as the result of a wide variety of periodic processes. The total curvature of a periodic arc in such curves constrains their symmetry. It is shown how the total…
Variational inference with natural-gradient descent often shows fast convergence in practice, but its theoretical convergence guarantees have been challenging to establish. This is true even for the simplest cases that involve concave…
Approximating complex curves with simple parametric curves is widely used in CAGD, CG, and CNC. This paper presents an algorithm to compute a certified approximation to a given parametric space curve with cubic B-spline curves. By…
The similarity of two polygonal curves can be measured using the Fr\'echet distance. We introduce the notion of a more robust Fr\'echet distance, where one is allowed to shortcut between vertices of one of the curves. This is a natural…
All known algorithms for the Fr\'echet distance between curves proceed in two steps: first, they construct an efficient oracle for the decision version; second, they use this oracle to find the optimum from a finite set of critical values.…
In a given geometry, the kinematics of a congruence of curves is described by a set of three quantities called expansion, rotation, and shear. The equations governing the evolution of these quantities are referred to as kinematic equations.…
Surface comparison and matching is a challenging problem in computer vision. While reparametrization-invariant Sobolev metrics provide meaningful elastic distances and point correspondences via the geodesic boundary value problem, solving…
We develop a cut finite element method for the Bernoulli free boundary problem. The free boundary, represented by an approximate signed distance function on a fixed background mesh, is allowed to intersect elements in an arbitrary fashion.…
We present a parametric finite element approximation of two-phase flow. This free boundary problem is given by the Stokes equations in the two phases, which are coupled via jump conditions across the interface. Using a novel variational…
We present a numerical method for computing the \textit{Fermi} and \textit{observational coordinates} of a distant test particle with respect to an observer. We apply this method for computing some previously introduced concepts of relative…
An important tool for experimental fluids mechanics research is Particle Image Velocimetry (PIV). Several robust methodologies have been proposed to perform the estimation of velocity field from the images, however, alternative methods are…
A main goal in the field of statistical shape analysis is to define computable and informative metrics on spaces of immersed manifolds, such as the space of curves in a Euclidean space. The approach taken in the elastic shape analysis…
This paper presents the generalization of weighted distances to modules and their computation through the chamfer algorithm on general point lattices. The first part is dedicated to formalization of definitions and properties (distance,…
We consider closed, embedded, smooth curves in the plane and study their behaviour under curve flows with a global forcing term. We prove an analogue to Huisken's distance comparison principle for curve shortening flow for initial curves…
A nonlocal curvature flow is introduced to evolve locally convex curves in the plane. It is proved that this flow with any initial locally convex curve has a global solution, keeping the local convexity and the elastic energy of the…
Discrete differential geometry aims to develop discrete equivalents of the geometric notions and methods of classical differential geometry. In this survey we discuss the following two fundamental Discretization Principles: the…