Accurate Circle Conngurations and Numerical Conformal Mapping in Polynomial Time
نویسنده
چکیده
| According to a remarkable re-interpretation of a theorem of E.M. Andreev (1970) by W.P. Thurston (1982), there is a unique (up to inversive transformations) packing of interior-disjoint circles in the plane, whose contact graph is any given polyhedral graph G, and such that an analagous \dual" circle packing simultaneously exists, whose contact graph is the planar dual graph G , and such that the primal and dual circle packin1qDgs have the same set of tangency points and the primal circles are orthogonal to the dual ones at these tangency points. This note shows that relatively and absolutely accurate coordinates for the primal and dual circles may be obtained in time polynomial in N, the number of vertices of the polyhedral graph, and D, the number of decimals of accuracy desired. Consequently one may also accurately \midscribe" a polyhedron { and simultaneously its dual { in polynomial time. Also consequently, one may implement Riemann's conformal mapping theorem numerically, in polynomial time with provable accuracy. Our result is obtained by generalizing and refor-mulating ideas found in the doctoral thesis of Walter Brr agger Math. Institut, Rheinsprung 21, CH-4051 Basel, Feb. 1991] to reduce our problem to maximizing a smooth convex function. This maximization problem is then solved by using Khachian's \ellipsoid method" or Vaidya's algorithm. 1 Background I T WILL BE ASSUMED that the reader is familiar with the basics of graph theory, hyperbolic geometry, and convex programming, and with the notion of \inver-sions" about Euclidean spheres. The uninitiated reader may consult 5, 18, 8, 9, 1], or, should he be lucky enough to obtain a copy, most of the relevant ideas and terminology in these areas are discussed in 13]. The version of the Andreev-Thurston theorem which we are interested in states that 1 Theorem 1 Andreev-Thurston in plane] There is a unique (up to inversive transformations) packing of interior-disjoint circles in the plane, whose contact graph is any given polyhedral graph G. If G is maximal pla-nar, this circle connguration is unique up to inversive transformations of the plane.] Furthermore an analagous \dual" circle packing simultaneously exists, whose contact graph is the planar dual graph G , and such that the primal and dual circles have the same set of tangency points and the primal circles are orthogonal to the dual ones at these tangency points. A graph is \polyhedral" ii it is 3-connected and pla-nar (a famous theorem …
منابع مشابه
Optimization of Conformal Mapping Functions used in Developing Closed-Form Solutions for Underground Structures with Conventional cross Sections
Elastic solutions applicable to single underground openings usually suffer from geometry related simplification. Most tunnel shapes possess two axes of symmetry while a wide range of geometries used in tunneling practice involve only one symmetry axis. D-shape or horse-shoe shape tunnels and others with arched roof and floor are examples of the later category (one symmetry axis). In the present...
متن کاملThe Approximation of Conformal Structures via Circle Packing
This is a pictorial tour and survey of circle packing techniques in the approximation of classical conformal objects. It begins with numerical conformal mapping and the conjecture of Thurston which launched this topic, moves to approximation of more general analytic functions, and ends with recent work on the approximation of conformal tilings and conformal structures. x1 Introduction A circle ...
متن کاملThe Approximation of Conformal Structuresvia Circle
This is a pictorial tour and survey of circle packing techniques in the approximation of classical conformal objects. It begins with numerical conformal mapping and the conjecture of Thurston which launched this topic, moves to approximation of more general analytic functions, and ends with recent work on the approximation of conformal tilings and conformal structures. x1 Introduction A circle ...
متن کامل20 04 Conformal Mapping Methods for Interfacial Dynamics
1 Microstructural evolution is typically beyond the reach of mathematical analysis, but in two dimensions certain problems become tractable by complex analysis. Via the analogy between the geometry of the plane and the algebra of complex numbers, moving free boundary problems may be elegantly formulated in terms of conformal maps. For over half a century, conformal mapping has been applied to c...
متن کاملCortical cartography using the discrete conformal approach of circle packings.
Cortical flattening algorithms are becoming more widely used to assist in visualizing the convoluted cortical gray matter sheet of the brain. Metric-based approaches are the most common but suffer from high distortions. Conformal, or angle-based algorithms, are supported by a comprehensive mathematical theory. The conformal approach that uses circle packings is versatile in the manipulation and...
متن کامل