Graph duality is a topological generalization of the geometric concepts. Properties counting any formula involving vertices. Care is needed to avoid topological complications as such points. Diagram is the Delaunay triangulation of the input. The circuit computes the function, reverses this construction converting the conjunctions.
Topological generalization of the geometric concepts, Eulerian, Subgraph of the dual graph