Given an embedding "G" of a (not necessarily simple) connected graph in the plane without edge intersections, we construct the dual graph "G"* as follows: we choose one vertex in each face of "G" (including the outer face) and for each edge "e" in "G" we introduce a new edge in "G"* connecting the two vertices in "G"* corresponding to the two faces in "G" that meet at "e". Furthermore, this edge is drawn so that it crosses "e" exactly once and that no other edge of "G" or "G"* is intersected. Then "G"* is again the embedding of a (not necessarily simple) planar graph; it has as many edges as "G", as many vertices as "G" has faces and as many faces as "G" has vertices. The term "dual" is justified by the fact that "G"** = "G"; here the equality is the equivalence of embeddings on the sphere. If "G" is the planar graph corresponding to a convex polyhedron, then "G"* is the planar graph corresponding to the dual polyhedron.