ACM Home Page
Please provide us with feedback. Feedback
Discrete conformal mappings via circle patterns
Full text PdfPdf (1.21 MB)
Source ACM Transactions on Graphics (TOG) archive
Volume 25 ,  Issue 2  (April 2006) table of contents
Pages: 412 - 438  
Year of Publication: 2006
ISSN:0730-0301
Authors
Liliya Kharevych  California Institute of Technology, Pasadena, CA
Boris Springborn  Technische Universität Berlin
Peter Schröder  California Institute of Technology, Pasadena, CA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 19,   Downloads (12 Months): 194,   Citation Count: 9
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1138450.1138461
What is a DOI?

ABSTRACT

We introduce a novel method for the construction of discrete conformal mappings from surface meshes of arbitrary topology to the plane. Our approach is based on circle patterns, that is, 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 supports very flexible boundary conditions ranging from free boundaries to control of the boundary shape via prescribed curvatures. Closed meshes of genus zero can be parameterized over the sphere. To parameterize higher genus meshes, we introduce cone singularities at designated vertices. The parameter domain is then a piecewise Euclidean surface. Cone singularities can also help to reduce the often very large area distortion of global conformal maps to moderate levels. Our method involves two optimization problems: a quadratic program and the unconstrained minimization of the circle pattern energy. The latter is a convex function of logarithmic radius variables with simple explicit expressions for gradient and Hessian. We demonstrate the versatility and performance of our algorithm with a variety of examples.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
Bobenko, A. I. and Springborn, B. A. 2004. Variational principles for circle patterns and Koebe's Theorem. Trans. Amer. Math. Soc. 356, 659--689.
 
3
Bobenko, A. I. and Springborn, B. A. 2005. A discrete Laplace-Beltrami operator for simplicial surfaces. http://arxiv.org/abs/math.DG/0503219.
 
4
Bowers, P. L. and Hurdal, M. K. 2003. Planar conformal mappings of piecewise flat surfaces. In Visualization and Mathematics III, H.-C. Hege and K. Polthier, Eds. Mathematics and Visualization. Springer-Verlag, Berlin, Germany, 3--34.
 
5
Brägger, W. 1992. Kreispackungen und Triangulierungen. L'Enseignement Mathématique 38, 201--217.
 
6
Colin de Verdière, Y. 1991. Un principe variationnel pour les empilements de cercles. Inventiones Mathematicae 104, 655--669.
 
7
 
8
Desbrun, M., Meyer, M., and Alliez, P. 2002. Intrinsic parameterizations of surface meshes. In Proceedings of Eurographics Computer Graphics Forum 21, 3, 209--218.
 
9
 
10
Erickson, J. and Har-Peled, S. 2004. Optimally cutting a surface into a disk. Discrete Computat. Geometry 31, 1, 37--59.
 
11
Friedel, I., Schröder, P., and Desbrun, M. 2005. Unconstrained spherical parameterization. (http://multires.caltech.edu/pubs/SParam_JGT.pdf). Submitted for Publication.
12
 
13
Grünbaum, B. 2003. Convex Polytopes, 2nd Ed. Graduate Texts in Mathematics, vol. 221. Springer-Verlag, New York, NY.
14
 
15
16
 
17
 
18
19
20
 
21
Leibon, G. 2002. Characterizing the Delaunay decompositions of compact hyperbolic surfaces. Geometry Topolo. 6, 361--391.
22
 
23
Mercat, C. 2001. Discrete Riemann surfaces and the Ising model. Comm. Math. Physics 218, 1, 177--216.
 
24
Mosek. 2005. Constrained quadratic minimization software. Version 3.1r42. http://www.mosek.com/.
 
25
Pinkall, U. and Polthier, K. 1993. Computing discrete minimal surfaces and their conjugates. Experim. Math. 2, 1, 15--36.
 
26
Ray, N., Li, W. C., Lévy, B., Sheffer, A., and Alliez, P. 2005. Periodic global parameterizations. (http://www.loria.fr/~levy/publications/papers/2005/PGP/pgp.pdf). Submitted for publication.
 
27
Rivin, I. 1994. Euclidean structures on simplicial surfaces and hyperbolic volume. Annals of Math. 139, 3, 553--580.
 
28
Rodin, B. and Sullivan, D. 1987. The convergence of circle packings to the Riemann mapping. J. Differ. Geometry 26, 2, 349--360.
29
 
30
 
31
Sheffer, A. and de Sturler, E. 2000. Surface Parameterization for meshing by triangulation flattening. In Proceedings of the 9th International Meshing Roundtable. Sandia National Labs, 161--172.
 
32
33
 
34
 
35
Springborn, B. A. 2005. A unique representation of polyhedral types. Centering via Möbius transformations. Mathematische Zeitschrift 249, 3, 513--517.
36
 
37
Thurston, W. P. 1980. The geometry and topology of three-manifolds. Available at http://www.msri.org/publications/books/gt3m/.
 
38
Thurston, W. P. 1985. The finite Riemann mapping theorem. At the Symposium on the Occasion of the Proof of the Bieberbach Conjecture. Purdue University (March).
 
39
Troyanov, M. 1991. Prescribing curvature on compact surfaces with conical singularities. Trans. Amer. Math. Society 324, 793--821.
 
40
Zayer, R., Rössl, C., and Seidel, H.-P. 2003. Convex boundary angle based flattening. In Proceedings of Vision, Modeling and Visualiza. 281--288.
41
 
42
Ziegler, G. M. 2004. Convex polytopes: Extremal constructions and f-vector shapes. IAS/Park City Mathematics Series, vol. 14. http://arxiv.org/abs/math/0411400. To Appear.

CITED BY  9
 
 
 
 

Collaborative Colleagues:
Liliya Kharevych: colleagues
Boris Springborn: colleagues
Peter Schröder: colleagues