Real‐Time Bijective Planar Maps

Abstract We describe a very simple algorithm to bijectively map between two simply‐connected bounded planar domains given a set of n point correspondences constraining the homeomorphic boundary mapping. The bijective map Φ is the composition of two harmonic maps h 1 and h 2 , which we call a double harmonic map. To compute Φ, we first map both domains to the unit disk using two conformal maps f 1 and f 2 and then determine a harmonic map g between the two disks that matches the boundary constraints. Composing f 1 with g gives h 1 , and h 2 is the inverse of f 2 . For the special case of n = 3 , g is a Möbius transformation and Φ reduces to the classical conformal map. Our method allows a graceful tradeoff between conformality and harmonicity, and is efficient enough to be used in an interactive shape deformation system. All the maps involved are defined exclusively through their boundary maps and extended to piecewise linear maps with harmonic coordinates after triangulating the domains.

Authors

Institutions

Publication Details

Journal
Computer Graphics Forum
Published
2026-11-13
DOI
https://doi.org/10.1111/cgf.70623
Primary Topic
3D Shape Modeling and Analysis
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Real‐Time Bijective Planar Maps

Kai Hormann, Qingjun Chang, Craig Gotsman
1 links
Computer Graphics Forum
3D Shape Modeling and Analysis
article

Real‐Time Bijective Planar Maps

Kai Hormann, Qingjun Chang, Craig Gotsman
article en

Abstract

Abstract We describe a very simple algorithm to bijectively map between two simply‐connected bounded planar domains given a set of n point correspondences constraining the homeomorphic boundary mapping. The bijective map Φ is the composition of two harmonic maps h 1 and h 2 , which we call a double harmonic map. To compute Φ, we first map both domains to the unit disk using two conformal maps f 1 and f 2 and then determine a harmonic map g between the two disks that matches the boundary constraints. Composing f 1 with g gives h 1 , and h 2 is the inverse of f 2 . For the special case of n = 3 , g is a Möbius transformation and Φ reduces to the classical conformal map. Our method allows a graceful tradeoff between conformality and harmonicity, and is efficient enough to be used in an interactive shape deformation system. All the maps involved are defined exclusively through their boundary maps and extended to piecewise linear maps with harmonic coordinates after triangulating the domains.

Computer Graphics Forum
New Jersey Institute of Technology (US), Xiamen University (CN), Università della Svizzera italiana (CH)
3D Shape Modeling and Analysis
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon