×

Curvature flow in conformal mapping. (English) Zbl 1073.52511

Summary: We use a simple example to introduce a notion of curvature flow in the conformal mapping of polyhedral surfaces. The inquiry was motivated by experiments with discrete conformal maps in the sense of circle packing. We describe the classical theory behind these flows and demonstrate how to modify the Schwarz-Christoffel method to obtain classical numerical confirmation. We close with some additional examples.

MSC:

52C26 Circle packings and discrete conformal geometry
30C30 Schwarz-Christoffel-type mappings
53A30 Conformal differential geometry (MSC2010)
65D15 Algorithms for approximation of functions
37E35 Flows on surfaces
53A05 Surfaces in Euclidean and related spaces
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Beardon, A. F., A primer on Riemann surfaces, London Math. Soc. Lecture Note Series, vol. 78 (1984), Cambridge: Cambridge Univ. Press, Cambridge · Zbl 0546.30001
[2] Beardon, A. F., A “regular” pentagonal tiling of the plane, Conformal Geometry and Dynamics, 1, 58-86 (1997) · Zbl 0883.05034 · doi:10.1090/S1088-4173-97-00014-3
[3] P. L. Bowers and K. Stephenson, Uniformizing dessins and Bely>l maps via circle packing, Amer. Math. Soc., to appear. · Zbl 1080.52511
[4] B. Chow and F. Luo, Combinatorial Ricci flows on surfaces, Preprint, 2002. · Zbl 1070.53040
[5] Collins, Ch R.; Stephenson, K., A circle packing algorithm, Comput. Geom., 25, 233-256 (2003) · Zbl 1023.52005 · doi:10.1016/S0925-7721(02)00099-8
[6] T. A. Driscoll, A MATLAB toolbox for Schwarz-Christoffel mapping, 1996. · Zbl 0884.30005
[7] Driscoll, T. A.; Trefethen, L. N., Schwarz-Christoffel Mapping, vol. 8 (2002), Cambridge, New York: Cambridge Univ. Press, Cambridge, New York · Zbl 1003.30005 · doi:10.1017/CBO9780511546808
[8] Dubejko, T.; Stephenson, K., Circle packing: Experiments in discrete analytic function theory, Exp. Math., 4, 4, 307-348 (1995) · Zbl 0853.52019 · doi:10.1080/10586458.1995.10504331
[9] Duren, P. L., Univalent Functions, vol. 259 (1983), New York: Springer-Verlag, New York · Zbl 0514.30001
[10] Hurdal, M. K.; Bowers, P. L.; Stephenson, K.; Sumners, D. W L.; Rehm, K.; Schaper, K.; Rottenberg, D. A.; Taylor, C.; Colchester, A., Quasi-conformally flat mapping the human cerebellum, Medical Image Computing and Computer-Assisted Intervention — MICCAI’99, vol. 1679, 279-286 (1999), Berlin: Springer, Berlin · doi:10.1007/10704282_31
[11] Cannon, J. W.; Floyd, W. J.; Parry, W., Finite subdivision rules, Conform. Geom. Dyn., 5, 153-196 (2001) · Zbl 1060.20037 · doi:10.1090/S1088-4173-01-00055-8
[12] Rodin, B.; Sullivan, D., The convergence of circle packings to the Riemann mapping, J. Differ. Geom., 26, 349-360 (1987) · Zbl 0694.30006
[13] Schramm, O., Scaling limits of loop-erased random walks and uniform spanning trees, Israel J. Math., 118, 221-288 (2000) · Zbl 0968.60093 · doi:10.1007/BF02803524
[14] Stephenson, K., A probabilistic proof of Thurston’s conjecture on circle packings, Rend. Semin. Mat. Fis. Milano, 66, 201-291 (1996) · Zbl 0997.60504 · doi:10.1007/BF02925361
[15] —, Approximation of conformal structures via circle packing, in: N. Papamichael, St. Ruscheweyh, and E. B. Saff (eds.), Computational Methods and Function Theory 1997, Proceedings of the Third CMFT Conference, vol. 11, World Scientific, 1999, 551-582. · Zbl 0932.30001
[16] —, Circle packing and discrete analytic function theory, in: R. Kuhnau (ed.), Handbook of Complex Analysis, Vol. 1: Geometric Function Theory, Elsevier, 2002. · Zbl 1067.30086
[17] W. Thurston, The finite Riemann mapping theorem, 1985, Invited talk, An International Symposium at Purdue University on the occasion of the proof of the Bieberbach conjecture, March 1985.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.