The (geometric) dual G∗ = (V ∗,E∗, F∗) of the plane graph G = (V,E, F)
can be defined as follows (see [2], pp. 252): Corresponding to each face f of G
there is a vertex f∗ of G∗, and corresponding to each edge e of G there is an
edge e∗ of G∗; two vertices f∗ and g∗ are joined by the edge e∗ in G∗ if and
only if their corresponding faces f and g are separated by the edge e in G (an
edge separates the faces incident with it).
The (geometric) dual G∗