An n log n algorithm for determining the congruity of polyhedra

AbstractThis paper describes an algorithm for determining whether two polyhedra are congruent. The asymptotic time complexity of the algorithm is bounded by a constant times n log n where n is the number of edges of the polyhedra, It is also shown that under some conditions the problem of partial congruity can be solved in O(n2) time