Related papers: Convergence of the Zipper algorithm for conformal …
Consider discrete conformal maps defined on the basis of two conformally equivalent triangle meshes, that is edge lengths are related by scale factors associated to the vertices. Given a smooth conformal map $f$, we show that it can be…
This paper is devoted to the study of conformal maps of the unit disk $\mathbb{D}$ in the plane onto a bounded Jordan domain $G$. The main aim is to show that such a map is asymptotically symmetric if and only if $G$ is bounded by a…
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 article we introduce a numerical algorithm for finding harmonic mappings by using the shear construction introduced by Clunie and Sheil-Small in 1984. The MATLAB implementation of the algorithm is based on the numerical conformal…
Let $S_i$, $i\in I$, be a countable collection of Jordan curves in the extended complex plane $\Sph$ that bound pairwise disjoint closed Jordan regions. If the Jordan curves are uniform quasicircles and are uniformly relatively separated,…
We study numerical computation of conformal invariants of domains in the complex plane. In particular, we provide an algorithm for computing the conformal capacity of a condenser. The algorithm applies for wide kind of geometries: domains…
Joint object matching, also known as multi-image matching, namely, the problem of finding consistent partial maps among all pairs of objects within a collection, is a crucial task in many areas of computer vision. This problem subsumes…
A classic result of Brooks, Smith, Stone and Tutte associates to any finite planar network with distinguished source and sink vertices, a tiling of a rectangle by smaller subrectangles whose aspect ratios are given by the conductances of…
We provide an algorithm to check whether two rational space curves are related by a similarity. The algorithm exploits the relationship between the curvatures and torsions of two similar curves, which is formulated in a computer algebra…
We study the approximation of conformal mappings with the polynomials defined by Keldysh and Lavrentiev from an extremal problem considered by Julia. These polynomials converge uniformly on the closure of any Smirnov domain to the conformal…
Aligning partially overlapping point sets where there is no prior information about the value of the transformation is a challenging problem in computer vision. To achieve this goal, we first reduce the objective of the robust point…
The conformal deformations are contained in two classes of mappings: quasiconformal and harmonic mappings. In this paper we consider the intersection of these classes. We show that, every $K$ quasiconformal harmonic mapping between…
The proximal point algorithm is a widely used tool for solving a variety of convex optimization problems such as finding zeros of maximally monotone operators, fixed points of nonexpansive mappings, as well as minimizing convex functions.…
Approximate integer programming is the following: For a convex body $K \subseteq \mathbb{R}^n$, either determine whether $K \cap \mathbb{Z}^n$ is empty, or find an integer point in the convex body scaled by $2$ from its center of gravity…
In this paper, we provide new discrete uniformization theorems for bounded, $m$-connected planar domains. To this end, we consider a planar, bounded, $m$-connected domain $\Omega$ and let $\bord\Omega$ be its boundary. Let $\mathcal{T}$…
We present a characterisation of blenders based on mapping properties of certain sets of curves that can be rigorously verified by computer-assisted methods. We develop an algorithm to construct these sets of curves that requires only a…
Since introduced by Martinet and Rockafellar, the proximal point algorithm was generalized in many fruitful directions. More recently, in 2002, Pennanen studied the proximal point algorithm without monotonicity. A year later, Iusem and…
We prove that a conformal mapping defined on the unit disk belongs to a weighted Bergman space if and only if certain integrals involving the harmonic measure converge. With the aid of this theorem, we give a geometric characterization of…
A fast algorithm (linear in the degrees of freedom) for the solution of linear variable-coefficient rational-order fractional integral and differential equations is described. The approach is related to the ultraspherical method for…
Families of conformal field theories are naturally endowed with a Riemannian geometry which is locally encoded by correlation functions of exactly marginal operators. We show that the curvature of such conformal manifolds can be computed…