Related papers: Harmonic Shears and Numerical Conformal Mappings
In a previous paper, an implementable algorithm was introduced to compute discrete solutions of sweeping processes (i.e. specific first order differential inclusions). The convergence of this numerical scheme was proved thanks to…
This paper presents Slime, a novel non-deep image matching framework which models the scene as rough local overlapping planes. This intermediate representation sits in-between the local affine approximation of the keypoint patches and the…
Point matching refers to the process of finding spatial transformation and correspondences between two sets of points. In this paper, we focus on the case that there is only partial overlap between two point sets. Following the approach of…
A numerical method optimizing the coefficients of the semi empirical mass formula or those of similar mass formulas is presented. The optimization is based on the least-squares adjustments method and leads to the resolution of a linear…
In this work we consider balanced Schnyder woods for planar graphs, which are Schnyder woods where the number of incoming edges of each color at each vertex is balanced as much as possible. We provide a simple linear-time heuristic leading…
The first result in this study is a non-existence theorem for $\alpha-$harmonic mappings. Additionally, a direct connection between the $\alpha-$ harmonic and harmonic maps is made possible via conformal deformation. Second, the instability…
Physically meaningful periodic solutions to certain integrable partial differential equations are given in terms of multi-dimensional theta functions associated to real Riemann surfaces. Typical analytical problems in the numerical…
Blending schemes based on circles provide smooth `fair' interpolations between series of points. Here we demonstrate a simple, robust set of algorithms for performing circle blends for a range of cases. An arbitrary level of G-continuity…
A novel method rooted in the classical Schwarz-Christoffel transformation from the disk is introduced, which allows for fast and accurate solution of potential field problems in possibly inhomogeneous and multiply connected domains: this is…
We present a sequential hierarchical least-squares programming solver with trust-region and hierarchical step-filter with application to prioritized discrete non-linear optimal control. It is based on a hierarchical step-filter which…
A low diffusion version of the HLL-CPS scheme for resolving the shear layers and the flow features at low Mach numbers is presented here. The low diffusion HLL-CPS scheme is obtained by reconstructing the velocities at the cell interface…
P. Baird and the second author studied harmonic morphisms from a three-dimensional simply-connected space form to a surface and obtained a complete local and global classification of them. In this paper, we obtain a description of all…
We present a novel shape-approximating anisotropic re-meshing algorithm as a geometric generalization of the adaptive moving mesh method. Conventional moving mesh methods reduce the interpolation error of a mesh that discretizes a given…
Harmonic mappings into Teichmuller spaces appear in the study of manifolds which are fibrations whose fibers are Riemann surfaces. In this article we will study the existence and uniquenesses questions of harmonic mappings into Teichmuller…
We introduce numerical algebraic geometry methods for computing lower bounds on the reach, local feature size, and the weak feature size of the real part of an equidimensional and smooth algebraic variety using the variety's defining…
This survey highlights the recent advances in algorithms for numerical linear algebra that have come from the technique of linear sketching, whereby given a matrix, one first compresses it to a much smaller matrix by multiplying it by a…
We give a uniform and elementary treatment of many classical and new triply periodic minimal surfaces in Euclidean space, based on a Schwarz-Christoffel formula for periodic polygons in the plane. Our surfaces share the property that…
Explicit harmonic and wave maps are typically available only in highly symmetric or constant-curvature settings, where additional symmetry or integrability structures are present. We develop a reduction framework for pseudo-Riemannian…
We compute a \emph{sparse} solution to the classical least-squares problem $\min_x||A x -b||,$ where $A$ is an arbitrary matrix. We describe a novel algorithm for this sparse least-squares problem. The algorithm operates as follows: first,…
Colour refinement is a basic algorithmic routine for graph isomorphism testing, appearing as a subroutine in almost all practical isomorphism solvers. It partitions the vertices of a graph into "colour classes" in such a way that all…