Papers › Computing quasiconformal folds

Computing quasiconformal folds

11 Apr 2018arXiv:1804.03936links table onlyarchive 2025-07-28

Di Qiu, Ka-Chun Lam, Lok-Ming Lui

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

We propose a novel way of computing surface folding maps via solving a linear PDE. This framework is a generalization to the existing quasiconformal methods and allows manipulation of the geometry of folding. Moreover, the crucial quantity that characterizes the geometry occurs as the coefficient of the equation, namely the Beltrami coefficient. This allows us to solve an inverse problem of parametrizing the folded surface given only partial data but with known folding topology. Various interesting applications such as fold sculpting on 3D models and self-occlusion reasoning are demonstrated to show the effectiveness of our method.

PaperPDFCode

Code

sylqiu/Least-square-beltrami-solver officialmentioned in papermentioned on GitHub report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections