Discrete conformal mappings via circle patterns
- Other:
- Fujii, John
Abstract
We introduce a novel method for the construction of discrete conformal mappings from (regions of) embedded meshes to the plane. Our approach is based on circle patterns, i.e., arrangements of circles---one for each face---with prescribed intersection angles. Given these angles the circle radii follow as the unique minimizer of a convex energy. The method has two principal advantages over earlier approaches based on discrete harmonic mappings: (1) it supports very flexible boundary conditions ranging from natural boundaries to control of the boundary shape via prescribed curvatures; (2) the solution is based on a convex energy as a function of logarithmic radius variables with simple explicit expressions for gradients and Hessians, greatly facilitating robust and efficient numerical treatment. We demonstrate the versatility and performance of our algorithm with a variety of examples.
Additional Information
© 2005 ACM. This work was supported in part by NSF (DMS-0220905, DMS-0138458, ACI-0219979), DFG (Research Center MATHEON "Mathematics for Key Technologies," Berlin), DOE (W-7405-ENG-48/B341492), nVidia, the Center for Integrated Multiscale Modeling and Simulation, Alias, and Pixar. Special thanks to Alexander Bobenko, Mathieu Desbrun, Ilja Friedel, and Cici Koenig.Additional details
- Eprint ID
- 72062
- Resolver ID
- CaltechAUTHORS:20161116-140825377
- NSF
- DMS-0220905
- NSF
- DMS-0138458
- NSF
- ACI-0219979
- Deutsche Forschungsgemeinschaft (DFG)
- Department of Energy (DOE)
- W-7405-ENG-48/B341492
- nVidia
- Center for Integrated Multiscale Modeling and Simulation
- Alias
- Pixar
- Created
-
2016-11-17Created from EPrint's datestamp field
- Updated
-
2023-10-23Created from EPrint's last_modified field