On Discrete Conformal Seamless Similarity Maps

05/06/2017
by   Marcel Campen, et al.
0

An algorithm for the computation of global discrete conformal parametrizations with prescribed global holonomy signatures for triangle meshes was recently described in [Campen and Zorin 2017]. In this paper we provide a detailed analysis of convergence and correctness of this algorithm. We generalize and extend ideas of [Springborn et al. 2008] to show a connection of the algorithm to Newton's algorithm applied to solving the system of constraints on angles in the parametric domain, and demonstrate that this system can be obtained as a gradient of a convex energy.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/13/2017

Maximal Area Triangles in a Convex Polygon

The widely known linear time algorithm for computing the maximum area tr...
research
01/08/2018

Reversible Harmonic Maps between Discrete Surfaces

Information transfer between triangle meshes is of great importance in c...
research
08/31/2022

Clairvoyant Regret Minimization: Equivalence with Nemirovski's Conceptual Prox Method and Extension to General Convex Games

A recent paper by Piliouras et al. [2021, 2022] introduces an uncoupled ...
research
08/02/2018

Triangle Estimation using Polylogarithmic Queries

Estimating the number of triangles in a graph is one of the most fundame...
research
09/08/2021

Convergence Analysis of the Algorithm in "Efficient and Robust Discrete Conformal Equivalence with Boundary"

In this note we prove that the version of Newton algorithm with line sea...
research
11/06/2017

A Linear Variational Principle for Riemann Mapping and Discrete Conformality

We consider Riemann mappings from bounded Lipschitz domains in the plane...
research
01/04/2018

Discrete symbolic optimization and Boltzmann sampling by continuous neural dynamics: Gradient Symbolic Computation

Gradient Symbolic Computation is proposed as a means of solving discrete...

Please sign up or login with your details

Forgot password? Click here to reset