An Proposed Algorithm for Generating Criteria Necessary to Establish Congruence between Two Convex N-Sided Polygons in Euclidean Geometry

Abstract

The research paper proposes an algorithm to find congruence criteria between two convex polygons in Euclidean Geometry. It begins with a review of triangles, then extends to quadrilaterals and eventually gener- alizes the case to n-sided polygons. It attempts to prove said algorithm using a method of induction and a case-by-case analysis. It also states a corollary to said algorithm