相关论文: On Computing Elastic Shape Distances between Curve…
Surface mapping plays an important role in geometric processing. They induce both area and angular distortions. If the angular distortion is bounded, the mapping is called a {\it quasi-conformal} map. Many surface maps in our physical world…
In this paper numerical methods of computing distances between two Radon measures on R are discussed. Efficient algorithms for Wasserstein-type metrics are provided. In particular, we propose a novel algorithm to compute the flat metric…
We present a PDE-based approach for finding optimal paths for the Reeds-Shepp car. In our model we minimize a (data-driven) functional involving both curvature and length penalization, with several generalizations. Our approach encompasses…
We establish a new framework for image registration, which is based on linear elasticity and optimal mass transportation theory. We combine these two arguments in order to obtain a PDE constrained optimization problem that is analytically…
What is the shortest path between two data points lying in a high-dimensional space? While the answer is trivial in Euclidean geometry, it becomes significantly more complex when the data lies on a curved manifold -- requiring a Riemannian…
Modelling deformation of anatomical objects observed in medical images can help describe disease progression patterns and variations in anatomy across populations. We apply a stochastic generalisation of the Large Deformation Diffeomorphic…
It was recently shown that under smoothness conditions, the squared Wasserstein distance between two distributions could be efficiently computed with appealing statistical error upper bounds. However, rather than the distance itself, the…
Convexity is a fundamental geometric prior that underlies many natural and man-made structures, yet remains challenging to impose effectively in end-to-end trainable segmentation networks. We revisit convexity from a functional perspective…
In this paper, we compute a conservative approximation of the path-connected components of the free space of a rigid object in a 2D workspace in order to solve two closely related problems: to determine whether there exists a collision-free…
The aim of this paper is the derivation of structure preserving schemes for the solution of the EPDiff equation, with particular emphasis on the two dimensional case. We develop three different schemes based on the Discrete Variational…
We study several versions of the alternating direction method of multipliers (ADMM) for solving the convex problem of finding the distance between two ellipsoids and the nonconvex problem of finding the distance between the boundaries of…
We study range spaces, where the ground set consists of either polygonal curves in $\mathbb{R}^d$ or polygonal regions in the plane that may contain holes and the ranges are balls defined by an elastic distance measure, such as the…
Numerical and analytical methods are developed for the investigation of contact sets in electrostatic-elastic deflections modeling micro-electro mechanical systems. The model for the membrane deflection is a fourth-order semi-linear partial…
Understanding crystal growth over arbitrary curved surfaces with arbitrary boundaries is a formidable challenge, stemming from the complexity of formulating non-linear elasticity using geometric invariant quantities. Solutions are generally…
This paper describes a method for steering deformable linear objects using two robot hands in environments populated by sparsely spaced obstacles. The approach involves manipulating an elastic inextensible rod by varying the gripping…
Multiview varieties are mathematical models for the set of image feature correspondences that can be produced by a given camera arrangement. They possess an invariant known as their Euclidean distance (ED) degree, which measures the…
We give an algorithm to compute a morph between any two convex drawings of the same plane graph. The morph preserves the convexity of the drawing at any time instant and moves each vertex along a piecewise linear curve with linear…
We present a full pipeline for computing the medial axis transform of an arbitrary 2D shape. The instability of the medial axis transform is overcome by a pruning algorithm guided by a user-defined Hausdorff distance threshold. The stable…
Many applications of computer vision rely on the alignment of similar but non-identical images. We present a fast algorithm for aligning heterogeneous images based on optimal transport. Our approach combines the speed of fast Fourier…
We investigate several computational problems related to the stochastic convex hull (SCH). Given a stochastic dataset consisting of $n$ points in $\mathbb{R}^d$ each of which has an existence probability, a SCH refers to the convex hull of…