Efficiently Identifying The Faces Of A Solid

An algorithm is described which accepts as input the edges of a convex polyhedron, listed in any order, and which produces a consistent collection of sequences of points which describe the faces of the polyhedron as required by certain display rendering packages. The algorithm makes use of the planarity tester of Hopcroft and Tarjan and is linear, in the number of points of the polyhedron, with respect to both time and space