Complex Transfinite Barycentric Mappings with Similarity Kernels

• Published in: Computer graphics forum Vol. 35; no. 5; pp. 41 - 53
• Main Authors: Chen, Renjie, Gotsman, Craig
• Format: Journal Article
• Language: English
• Published: Oxford Blackwell Publishing Ltd 01.08.2016
• Subjects: Algebra; Algorithms; Analysis; Boundaries; Categories and Subject Descriptors (according to ACM CCS); G.1.1 [Numerical Analysis]: Interpolation-Interpolation formulas; I.3.5 [Computer Graphics]: Computer Gemetry and Object Modeling-Boundary representations; Image processing systems; Kernels; Laplace transforms; Mapping; Mathematical models; Rendering; Shape; Similarity; Studies
• ISSN: 0167-7055; 1467-8659
• DOI: 10.1111/cgf.12962

Transfinite barycentric kernels are the continuous version of traditional barycentric coordinates and are used to define interpolants of values given on a smooth planar contour. When the data is two‐dimensional, i.e. the boundary of a planar map, these kernels may be conveniently expressed using complex number algebra, simplifying much of the notation and results. In this paper we develop some of the basic complex‐valued algebra needed to describe these planar maps, and use it to define similarity kernels, a natural alternative to the usual barycentric kernels. We develop the theory behind similarity kernels, explore their properties, and show that the transfinite versions of the popular three‐point barycentric coordinates (Laplace, mean value and Wachspress) have surprisingly simple similarity kernels. We furthermore show how similarity kernels may be used to invert injective transfinite barycentric mappings using an iterative algorithm which converges quite rapidly. This is useful for rendering images deformed by planar barycentric mappings.