Dual
The
dual
,
D
of a
planar graph
G
is constructed as follows:
Draw a vertex in
D
for every
region
in
G
.
Draw an edge connecting a pair of vertices in
D
if these two regions in
G
share a border.
Copyright © 1999-2000 SciMathMN
