11006059

1
,
.,
.
.
,
, .
. .
,
. , ,
. ,
, .
:

• .,
.

• .
, .

• . , 6
, 3, .
.

• , .

• ,
. , . ,
.
 • ,
, .

• , : .
, ( ) .
.

, ,
., ,
.

1.1

1:

(a) Circle packing (b) Checkboard

2:

Fleix Klein Erlangen ,

. ..
 , 1 . ,.
,. 2 , bunny
. circle packing, bunny
circle packing. , bunny ,
.
, .
, .
, , .
.
, . ,
.
,. ,
, .,
.

1.2
. :

1.
, .
Abelian , .

2.
. ,
, .
.

3.
uniformization Gauss
. , .
.

4.
 () .

5.
,.
, .
Beltrami , Beltrami .
Beltrami . Beltrami
, .

6.
.
.

1.3
. :

1.
.
.

2.
Gauss ,
., .
,, .

3.
, .
.

4.
.
.
 5.
. ,
,, Laplace-Beltrami , .
. ,
.

3:

4: . (a) A cut graph system of loops. (b) A system of loops. (c)

system of loops. (d) , cut graph.

,
. ,
. .
 5: : , handle() tunnel() , handle

2.1
, .
cut graph, .
cut graph, ,.
, . ,
, 3.
Vegter Yap [1] , Lazarus [2] Vegter
Yap , O(gn), n, g . 2g
, . ,
, cut graph . cut graph
, 4 . Dey Schipper [3] cut
graph . 2002 , Erickson [4]

cut graph : , cut graph.

cut graph NP , cut graph ,
O(g 2 n log n), O(log2 g). de Verdière Lazarus [5]
"systerm of loops" cut graph, systerm of loops 2g
, 4 . Erickson [6]

, de Verdière Lazarus systerm of loops .

 , handles tunnels,
, 5 . Dey [7--9] handles
tunnels . Yin [10] universal covering space
. de Verdière [11] pants . Xin [12]

., [13--19] , .

(a) 1 (b) 1

6: 1

2.2
. [20--25] .
Schwarz-Christoffel [26,27] . [28--30]
Schwarz-Christoffel . [ 31] Delaunay
. , Marshall [32] geodesic zippper , Bishop [33]
.

2.3 0
[34] , Lévy [35] Cauchy-Riemann
. 2002 , Desbrun [36] Dirichlet .
Floater [37] . [38, 39]
. CG , [40, 41] .
2.4
: .

7: 1

2.4.1
Gu Yau [42,43] ,
. Hodge , ,
6(a)6(b) . Hodge , 7.
. Pinkall [34] Hodge .
Mercat [44] Cauchy-Riemann ,
. 2003 , Hirani [45] .
Gortler [46,47] 1 1 .Tong [48]

1 , remeshing tiling. 2009 , Zeng [49,50]

0 ,.

2.4.2 Ricci Flow

Ricci Hamilton [51] Princeton . Ricci
, . ,
 Poincaré . Hamilton [52] 2 Ricci
uniformization . CG .

8: Circle packing

, Thurston [53]
circle packing . circle packing Koebe , Thurston
Jordan circle packing Riemann , 8. Rodin
Sullivan [54] .
Colin de Verdière [55] circle packing , Thurston
circle packing . circle packing ,
Collins Stephenson [56] . Chow Luo [57] Colin de Verdière
, Ricci Ricci . Ricci
, Ricci . , Jin [58] 2008
Ricci .
circle pattern,
, circle packing . Circle pattern Bowers Hurdal [59] ,
Bobenko Springborn [60] . 2006 , Kharevych [61]

circle pattern .

2.4.3 Yamabe Flow

Yamabe Riemann . Yamabe [62]
, Trudinger [63] , Aubin [64] Schoen [65]
. Lee Parker [66] .

2004 , Luo [67] Yamabe .

, Yamabe .
, Luo Yamabe 1 ,
. Yamabe .
, Springborn [68] Yamabe Milnor-
Lobachevsky , Laplace . Gu
[69] Yamabe . Bobenko [70]

Yamabe , Zeng [71] .

9:

10:

2.5

2.5.1
CG .
[42] . , . 9
.
, 10.
 11:

2.5.2

, , 11 12.
, ,
. , .
, . Gu [72] .

.
, 13 .,
[73] , ,
. , , Laplace-Beltrami ,
.

2.5.3
. ,
. , ,
 12:

13:

. 14
[39] , ,,
.

2.5.4
. 15 .
16 , [74--76] .Teichmüller

[77,78] . Ricci , uniformization

. pants Fenchel-Nielsen . 17
, 18 Teichmüller .
 14:

15:

2.5.5
, . Ricci uniformiza-
tion [71] . Gauss-Bonnet , . ,
Möbius ,
. 19, .
 16:

17:

3
,
., .
. ,
. .

1. Teichmüller
, angle distortion ,
Teichmüller .
 18: Teichmüller Fenchel-Nielsen

19:

2. Abel
Abel , .

3.
, circle packing
,.

4.
, .
, . ,
.

5.
. .
. circle packing
 Yamabe , .
, . ,
. circle packing , .
 [1] Vegter, G., Yap, C.K., 1990. Computational complexity of combinatorial surfaces. In: Proceedings
of the sixth annual symposium on Computational geometry. New York: ACM, 102-111.
[2] Lazarus, F., Pocchiola, M., Vegter, G., et al, 2001. Computing a canonical polygonal schema of an
orientable triangulated surface. In: SCG '01: Proceedings of the seventeenth annual symposium on
Computational geometry. New York: ACM, 80-89.
[3] Dey, T.K., 1994. A new technique to compute polygonal schema for 2-manifolds with applica-
tion to null-homotopy detection. In: Proceedings of the tenth annual symposium on Computational
geometry. New York: ACM, 277-284.
[4] Erickson, J., Har-Peled, S., 2002. Optimally cutting a surface into a disk. In: SCG '02: Proceedings
of the eighteenth annual symposium on Computational geometry. New York: ACM, 244-253.
[5] de Verdière, E.C., Lazarus, F., 2002. Optimal system of loops on an orientable surface. In: Proc.
43rd Annual IEEE Symp. Foundations of Computer Science. Springer-Verlag 627-636.
[6] Erickson, J., Whittlesey, K., 2005. Greedy optimal homotopy and homology generators. In: SODA
'05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms. Philadel-
phia, PA, USA: Society for Industrial and Applied Mathematics, 1038-1046.
[7] Dey, T.K., Li, K., Sun, J., 2007. On computing handle and tunnel loops. In: CW '07: Proceedings
of the 2007 International Conference on Cyberworlds. Washington, DC, USA: IEEE Computer
Society, 357-366.
[8] Dey, T.K., Li, K., Sun, J., et al, 2008. Computing geometry-aware handle and tunnel loops in 3d
models. In: SIGGRAPH '08: ACM SIGGRAPH 2008 papers. New York: ACM, 1-9.
[9] Dey, T.K., Li, K., Sun, J., 2009. Computing handle and tunnel loops with knot linking. Comput.
Aided Des., 41(10): 730-738.
[10] Yin, X., Jin, M., Gu, X., 2007. Computing shortest cycles using universal covering space. Vis.
Comput., 23(12): 999-1004.
[11] Verdière, E.C.D., Lazarus, F., 2007. Optimal pants decompositions and shortest homotopic cycles
on an orientable surface. J. ACM, 54(4): 18.
[12] Xin, S.Q., He, Y., Fu, C.W., et al, 2011. Euclidean geodesic loops on high-genus surfaces applied
to the morphometry of vestibular systems. In: MICCAI'11: Proceedings of the 14th international
conference on Medical image computing and computer-assisted intervention. Berlin, Heidelberg:
Springer-Verlag, 384-392.
[13] Chambers, E.W., Erickson, J., Worah, P., 2008. Testing contractibility in planar rips complexes. In:
SCG '08: Proceedings of the twenty-fourth annual symposium on Computational geometry. New
York: ACM, 251-259.
[14] Chambers, E.W., Erickson, J., Nayyeri, A., 2009. Minimum cuts and shortest homologous cycles.
In: SCG '09: Proceedings of the 25th annual symposium on Computational geometry. New York:
ACM, 377-385.
[15] Chambers, E.W., Erickson, J., Nayyeri, A., 2009. Homology flows, cohomology cuts. In: STOC
 '09: Proceedings of the 41st annual ACM symposium on Theory of computing. New York: ACM,
273-282.
[16] Erickson, J., 2010. Maximum flows and parametric shortest paths in planar graphs. In: SODA
'10: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms.
Philadelphia, PA, USA: Society for Industrial and Applied Mathematics, 794-804.
[17] Erickson, J., Worah, P., 2010. Computing the shortest essential cycle. Discrete Comput. Geom.,
44(4): 912-930.
[18] Dey, T.K., Hirani, A.N., Krishnamoorthy, B., 2010. Optimal homologous cycles, total unimodular-
ity, and linear programming. In: STOC '10: Proceedings of the 42nd ACM symposium on Theory
of computing. New York: ACM, 221-230.
[19] Erickson, J., 2011. Shortest non-trivial cycles in directed surface graphs. In: SoCG '11: Proceedings
of the 27th annual ACM symposium on Computational geometry. New York: ACM, 236-243.
[20] Delillo, T.K., 1994. The accuracy of numerical conformal mapping methods: A survey of examples
and results. SIAM Journal on Numerical Analysis, 31(3): pp.788-812.
[21] Ivanov, M., V. T, 1995. Handbook of conformal mapping with computer-aided visualization. Boca
Raton: CRC Press.
[22] Binder, I., Braverman, M., Yampolsky, M., 2007. On the computational complexity of the riemann
mapping. ARKIV FOR MATEMATIK, 45(2): 221-239.
[23] Trefethen, L., 1986. Numerical conformal mapping. Amsterdam: North-Holland Publishing Co.
[24] Wegmann, R., 2005. Handbook of Complex Analysis: Geometric Function Theory. vol 2. Ams-
terdam: Elsevier, 351-477.
[25] Henrici, , 1993. Discrete Fourier Analysis, Cauchy Integrals, Construction of Conformal Maps,
Univalent Functions. vol 3. London: Wiley.
[26] Driscoll, T.A., Trefethen, L.N. 2002. Schwarz-Christoffel Mapping. Cambridge Press.
[27] Banjai, L., Trefethen, L.N., 2003. A multipole method for schwarz--christoffel mapping of poly-
gons with thousands of sides. SIAM J. Sci. Comput., 25(3): 1042-1065.
[28] DeLillo, T.K., Elcrat, A.R., Pfaltzgraff, J.A., 2001. Schwarz-christoffel mapping of the annulus.
SIAM Review, 43(3): pp.469-477.
[29] Delillo, T., Elcrat, A., Pfaltzgraff, J., 2004. Schwarz-christoffel mapping of multiply connected
domains. Journal d'Analyse Mathématique, 94: 17-47.
[30] Crowdy, D., 2005. The schwarz-christoffel mapping to bounded multiply connected polygonal
domains. Proceedings: Mathematical, Physical and Engineering Sciences, 461(2061): pp.2653-
2678.
[31] Driscoll, T.A., Vavasis, S.A., 1998. Numerical conformal mapping using cross-ratios and delaunay
triangulation. SIAM J. Sci. Comput., 19: 1783-1803.
[32] Marshall, D.E., Rohde, S., 2007. Convergence of a variant of the zipper algorithm for conformal
mapping. SIAM J. Numer. Anal., 45: 2577-2609.
[33] Bishop, C.J., 2010. Conformal mapping in linear time. Discrete Comput. Geom., 44: 330-428.
[34] Pinkall, U., Polthier, K., 1993. Computing discrete minimal surfaces and their conjugates. Exper-
imental Mathematics, 2: 15-36.
[35] Lévy, B., Petitjean, S., Ray, N., et al, 2002. Least squares conformal maps for automatic texture atlas
generation. In: Proceedings of the 29th annual conference on Computer graphics and interactive
techniques. New York: ACM, 362-371.
[36] Desbrun, M., Meyer, M., Alliez, P., 2002. Intrinsic parameterizations of surface meshes. Computer
Graphics Forum, 21(3): 209-218.
[37] Floater, M.S., 2003. Mean value coordinates. Comput. Aided Geom. Des., 20: 19-27.
[38] Gotsman, C., Gu, X., Sheffer, A., 2003. Fundamentals of spherical parameterization for 3d meshes.
In: SIGGRAPH '03: ACM SIGGRAPH 2003 Papers. New York: ACM, 358-363.
[39] Gu, X., Wang, Y., Chan, T.F., et al, 2004. Genus zero surface conformal mapping and its application
to brain surface mapping. IEEE Transactions on Medical Imaging, 23: 949-958.
[40] Floater, M.S., Hormann, K., 2005. Surface parameterization: a tutorial and survey. In: Dodgson,
N.A., Floater, M.S., Sabin, M.A.. Advances in multiresolution for geometric modelling. Springer
Verlag, 157-186.
[41] Sheffer, A., Praun, E., Rose, K., 2006. Mesh parameterization methods and their applications.
Found. Trends. Comput. Graph. Vis., 2: 105-171.
[42] Gu, X., Yau, S.T., 2003. Global conformal surface parameterization. In: SGP '03: Proceedings
of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing. Aire-la-Ville,
Switzerland, Switzerland: Eurographics Association, 127-137.
[43] Jin, M., Wang, Y., Yau, S.T., et al, 2004. Optimal global conformal surface parameterization.
In: VIS '04: Proceedings of the conference on Visualization '04. Washington, DC, USA: IEEE
Computer Society, 267-274.
[44] Mercat, C., 2001. Discrete riemann surfaces and the ising model. Communications in Mathematical
Physics, 218: 177-216.
[45] Hirani, A.N., 2003. Discrete exterior calculus. PhD thesis. Pasadena, CA, USA: California Institute
of Technology.
[46] Gortler, S.J., Gotsman, C., Thurston, D., 2006. Discrete one-forms on meshes and applications to
3d mesh parameterization. Comput. Aided Geom. Des., 23: 83-112.
[47] Tewari, G., Gotsman, C., Gortler, S.J., 2006. Meshing genus-1 point clouds using discrete one-
forms. Computers and Graphics, 30: 917-926.
[48] Tong, Y., Alliez, P., Cohen-Steiner, D., et al, 2006. Designing quadrangulations with discrete
harmonic forms. In: Proceedings of the fourth Eurographics symposium on Geometry processing.
Aire-la-Ville, Switzerland, Switzerland: Eurographics Association, 201-210.
[49] Zeng, W., Yin, X., Zhang, M., et al, 2009. Generalized koebe's method for conformal mapping
multiply connected domains. In: SPM '09: 2009 SIAM/ACM Joint Conference on Geometric and
 Physical Modeling. New York: ACM, 89-100.
[50] Zeng, W., Luo, F., Yau, S.T., et al, 2009. Surface quasi-conformal mapping by solving beltrami
equations. In: Proceedings of the 13th IMA International Conference on Mathematics of Surfaces
XIII. Berlin, Heidelberg: Springer-Verlag, 391-408.
[51] Hamilton, R., 1982. Three manifolds with positive ricci curvature. J. Differ. Geom., 17: 255-306.
[52] Hamilton, R., 1988. Mathematics and General Relativity. vol 71. American Mathematical Society.
[53] Thurston, W., 1980. Geometry and Topology of Three-Manifolds. Princeton University Press.
[54] Rodin, B., Sullivan, D., 1987. The convergence of circle packings to the riemann mapping. J.
Differ. Geom., 26(2): 349-360.
[55] Colin de Verdière, Y., 1991. Un principle variationnel pour les empilements de cercles. Invent.
Math., 104(3): 655-669.
[56] Collins, C.R., Stephenson, K., 2003. A circle packing algorithm. Comput. Geom. Theory Appl.,
25: 233-256.
[57] Chow, B., Luo, F., 2003. Combinatorial ricci flows on surfaces. J. Differ. Geom., 63(1): 97-129.
[58] Jin, M., Kim, J., Luo, F., et al, 2008. Discrete surface ricci flow. IEEE Transactions on Visualization
and Computer Graphics, 14(5): 1030-1043.
[59] Bowers, P.L., Hurdal, M.K., 2003. Planar conformal mappings of piecewise flat surfaces. In: In Vi-
sualization and Mathematics III, H.-C. Hege and K. Polthier, Eds. Mathematics and Visualization.
Springer-Verlag 3-34.
[60] Bobenko, A.I., Springborn, B.A., 2004. Variantional principles for circle patterns and koebe's
theorem. Trans. Am. Math. Soc., 356: 659-689.
[61] Kharevych, L., Springborn, B., Schröder, P., 2006. Discrete conformal mappings via circle patterns.
ACM Trans. Graph., 25: 412-438.
[62] Yamabe, H., 1960. The yamabe problem. Osaka Math. J., 12(1): 21-37.
[63] Trudinger, N., 1968. Remarks concerning the conformal deformation of riemannian structures on
compact manifolds. Ann. Scuola Norm. Sup. Pisa, 22(2): 265-274.
[64] Aubin, T., 1976. équations diffréntielles non linéaires et problème de yamabe concernant la cour-
bure scalaire. J. Math. Pure Appl., 55(3): 269-296.
[65] Schoen, R., 1984. Conformal deformation of a riemann metric to constant scalar curvature. J.
Differ. Geom., 20(2): 479-495.
[66] Lee, J.M., Parker, T.H., 1987. The yamabe problem. Bull. Am. Math. Soc., 17(1): 39-71.
[67] Luo, F., Khan, L., Bastani, F., et al, 2004. A dynamically growing self-organizing tree (dgsot) for
hierarchical clustering gene expression profiles. Bioinformatics, 20(16): 2605-2617.
[68] Springborn, B., Schröder, P., Pinkall, U., 2008. Conformal equivalence of triangle meshes. In:
SIGGRAPH Asia '08: ACM SIGGRAPH ASIA 2008 courses. New York: ACM, 1-11.
[69] Yin, X., Jin, M., Luo, F., et al, 2009. Emerging trends in visual computing. In: . Berlin, Heidelberg:
 Springer-Verlag, 38-74.
[70] Bobenko, A., Springborn, B., Pinkall, U., 2010. Discrete conformal maps and ideal hyperbolic
polyhedra. arXiv:1005.2698.
[71] Zeng, W., Jin, M., Luo, F., et al, 2009. Canonical homotopy class representative using hyperbolic
structure. In: Proc. IEEE Int. Conf. Shape Modeling and Applications SMI 2009. 171-178.
[72] Gu, X., He, Y., Qin, H., 2006. Manifold splines. Graph. Models, 68(3): 237-254.
[73] Crane, K., Desbrun, M., Schröder, P., 2010. Trival connections on discrete surfaces. Comput.
Graph. Forum, 29(5): 1525-1533.
[74] Wang, S., Wang, Y., Jin, M., et al, 2007. Conformal geometry and its applications on 3d shape
matching, recognition, and stitching. IEEE Trans. Pattern Anal. Mach. Intell., 29(7): 1209-1220.
[75] Zeng, W., Zeng, Y., Wang, Y., et al, 2008. 3d non-rigid surface matching and registration based
on holomorphic differentials. In: ECCV '08: Proceedings of the 10th European Conference on
Computer Vision. Berlin, Heidelberg: Springer-Verlag, 1-14.
[76] Zeng, W., Samaras, D., Gu, D., 2010. Ricci flow for 3d shape analysis. IEEE Trans. Pattern Anal.
Mach. Intell., 32(4): 662-677.
[77] Zeng, W., Lui, L.M., Gu, X., Yau, S.T., 2008. Shape analysis by conformal modules. Methods
Appl. Anal., 15(4): 539-556.
[78] Jin, M., Zeng, W., Ning, D., Gu, X., 2009. Computing fenchel-nielsen coordinates in teichmüller
shape space. In: IEEE International Symposium on Information Processing in Sensor Networks.
121-132.