14.02.2013 Views

Gruber P. Convex and Discrete Geometry

Gruber P. Convex and Discrete Geometry

Gruber P. Convex and Discrete Geometry

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

34 Koebe’s Representation Theorem for Planar Graphs 505<br />

ū<br />

Du<br />

Dv<br />

Fig. 34.4. Kite<br />

to the country 4-cycles in G ′ with vertex u (Fig. 34.4). Since this holds for any vertex,<br />

the disc Du touches only those discs Dv or their boundaries intersect orthogonally,<br />

for which ¯v is a vertex of a kite with vertex ū. Hence the discs Du : u ∈ V(G ′ ) form<br />

a weak primal-dual circle packing of G, concluding the proof of (4).<br />

In the fifth step we refine (4):<br />

(5) Let ρ = � ρv : v ∈ V(G ′ ) � satisfy (1)(i,ii). Then there exists a primal-dual<br />

circle packing of G.<br />

Assume first that the outer cycle of G is a 3-cycle v1v2v3. By (4) there is a weak<br />

primal-dual circle packing of G. By applying a suitable Möbius transformation <strong>and</strong><br />

changing notation, if necessary, we obtain a weak primal-dual circle packing of G<br />

<strong>and</strong> such that ¯v1, ¯v2, ¯v3 are the vertices of a regular triangle with centroid 0. Since<br />

the discs Dv1 , Dv2 , Dv3 with centres ¯v1, ¯v2, ¯v3 touch pairwise, they all have the<br />

same radius. Hence there is a circular disc D∞ with centre ∞ such that its boundary<br />

circle intersects orthogonally the boundary circles of the discs Dv1 , Dv2 , Dv3<br />

at the points where these discs touch pairwise. This yields the desired primal-dual<br />

circle packing of G (Fig. 34.5). If, second, the outer cycle of G has length greater<br />

than 3, then either G or G∗ has a country 3-cycle by the Corollary 15.1 of the Euler<br />

polytope formula. Interchanging the roles of G <strong>and</strong> G∗ , if necessary, <strong>and</strong> applying a<br />

suitable Möbius transformation, if necessary, we arrive at the same situation as in the<br />

previous paragraph. Thus there exists a corresponding primal-dual circle packing.<br />

The inverse of the Möbius transformation then yields the desired primal-dual circle<br />

packing of G.<br />

In the sixth step we prepare the way for the seventh step:<br />

(6) Let S � V(G ∧ ) with #S ≥ 5. Then 2#S − #E � G ∧ (S) � ≥ 5.<br />

Here G ∧ (S) is the subgraph of G ∧ with vertex set S whose edges are precisely<br />

the edges uv of G ∧ with u,v ∈ S. To see (6), note first that the following<br />

holds:<br />

¯v

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!