Related papers: Bijective Deformations in $\mathbb{R}^n$ via Integ…
Standard spatial convolutions assume input data with a regular neighborhood structure. Existing methods typically generalize convolution to the irregular point cloud domain by fixing a regular "view" through e.g. a fixed neighborhood size,…
We consider a simply supported plate with constant thickness, defined on an unknown multiply connected domain. We optimize its shape according to some given performance functional. Our method is of fixed domain type, easy to be implemented,…
In this paper we provide a computational approach to the shape of curves which are rational in polar coordinates, i.e. which are defined by means of a parametrization (r(t),\theta(t)) where both r(t),\theta(t) are rational functions. Our…
In the elastic shape analysis approach to shape matching and object classification, plane curves are represented as points in an infinite-dimensional Riemannian manifold, wherein shape dissimilarity is measured by geodesic distance. A…
In this paper, we introduce a definition of discrete conformality for triangulated surfaces with flat cone metrics and describe an algorithm for solving the problem of prescribing curvature, that is to deform the metric discrete conformally…
Boundary detection is essential for a variety of computer vision tasks such as segmentation and recognition. In this paper we propose a unified formulation and a novel algorithm that are applicable to the detection of different types of…
By studying $\mathbb{A}^1$-curves on varieties, we propose a geometric approach to strong approximation problem over function fields of complex curves. We prove that strong approximation holds for smooth, low degree affine complete…
This paper puts forth a new formulation and algorithm for the elastic matching problem on unparametrized curves and surfaces. Our approach combines the frameworks of square root normal fields and varifold fidelity metrics into a novel…
A chord diagram is a circle with paired points with each pair of points connected by a chord. Every generic immersed spherical curve provides a chord diagram by associating each chord with two preimages of a double point. Any two spherical…
We adopt a measure-theoretic perspective on the Riemannian approximation scheme proving a sub-Riemannian Gauss-Bonnet theorem for surfaces in 3D contact manifolds. We show that the zero-order term in the limit is a singular measure…
In theory, diffusion curves promise complex color gradations for infinite-resolution vector graphics. In practice, existing realizations suffer from poor scaling, discretization artifacts, or insufficient support for rich boundary…
Shearlet systems have so far been only considered as a means to analyze $L^2$-functions defined on $\R^2$, which exhibit curvilinear singularities. However, in applications such as image processing or numerical solvers of partial…
In this work we present an extension of the Virtual Element Method with curved edges for the numerical approximation of the second order wave equation in a bidimensional setting. Curved elements are used to describe the domain boundary, as…
In this article, we will formulate a mathematical framework that allows us to treat character animations as points on infinite dimensional Hilbert manifolds. Constructing geodesic paths between animations on those manifolds allows us to…
We consider point sets in the $m$-dimensional affine space $\mathbb{F}_q^m$ where each squared Euclidean distance of two points is a square in $\mathbb{F}_q$. It turns out that the situation in $\mathbb{F}_q^m$ is rather similar to the one…
An intersection digraph is a digraph where every vertex $v$ is represented by an ordered pair $(S_v, T_v)$ of sets such that there is an edge from $v$ to $w$ if and only if $S_v$ and $T_w$ intersect. An intersection digraph is reflexive if…
We consider the problem of answering connectivity queries on a real algebraic curve. The curve is given as the real trace of an algebraic curve, assumed to be in generic position, and being defined by some rational parametrizations. The…
This paper presents and investigates an inexact proximal gradient method for solving composite convex optimization problems characterized by an objective function composed of a sum of a full-domain differentiable convex function and a…
This paper develops an algorithm that identifies and decomposes a median graph of a triangulation of a 2-dimensional (2D) oriented bordered surface and in addition restores all corresponding triangulation whenever they exist. The algorithm…
We provide an algorithm of constructing a rectifiable curve between two sufficiently close points of a proximally smooth set in a uniformly convex and uniformly smooth Banach space. Our algorithm returns a reasonably short curve between two…