Face recognition of wireframe polyhedra using fundamental cycles

Presents the recognition of cycles representing the faces of a wireframe polyhedron configuration using fundamental cycles. The 2D wireframe is considered to be an undirected graph. All the faces around each vertex are selected from fundamental cycles and used to reduce the graph. The unretrieved faces, if any, are recovered by the remaining graph. The time complexity is O(n) for “distributed polyhedra”, where n is the number of vertices