A Subspace Method for Fast Locally Injective Harmonic Mapping

Eden Fedida Hefetz, Edward Chien, Ofir Weber

Research output: Contribution to journalArticlepeer-review

16 Scopus citations


We present a fast algorithm for low-distortion locally injective harmonic mappings of genus 0 triangle meshes with and without cone singularities. The algorithm consists of two portions, a linear subspace analysis and construction, and a nonlinear non-convex optimization for determination of a mapping within the reduced subspace. The subspace is the space of solutions to the Harmonic Global Parametrization (HGP) linear system [BCW17], and only vertex positions near cones are utilized, decoupling the variable count from the mesh density. A key insight shows how to construct the linear subspace at a cost comparable to that of a linear solve, extracting a very small set of elements from the inverse of the matrix without explicitly calculating it. With a variable count on the order of the number of cones, a tangential alternating projection method [HCW17] and a subsequent Newton optimization [CW17] are used to quickly find a low-distortion locally injective mapping. This mapping determination is typically much faster than the subspace construction. Experiments demonstrating its speed and efficacy are shown, and we find it to be an order of magnitude faster than HGP and other alternatives.

Original languageEnglish
Pages (from-to)105-119
Number of pages15
JournalComputer Graphics Forum
Issue number2
StatePublished - May 2019

Bibliographical note

Publisher Copyright:
© 2019 The Author(s) Computer Graphics Forum © 2019 The Eurographics Association and John Wiley & Sons Ltd. Published by John Wiley & Sons Ltd.


  • CCS Concepts
  • Mesh geometry models
  • • Computing methodologies → Mesh models
  • • Mathematics of computing → Topology


Dive into the research topics of 'A Subspace Method for Fast Locally Injective Harmonic Mapping'. Together they form a unique fingerprint.

Cite this