Version 1
: Received: 28 March 2023 / Approved: 28 March 2023 / Online: 28 March 2023 (13:50:44 CEST)
How to cite:
Rafi, S. An Proposed Algorithm for Generating Criteria Necessary to Establish Congruence between Two Convex N-Sided Polygons in Euclidean Geometry. Preprints2023, 2023030490. https://doi.org/10.20944/preprints202303.0490.v1
Rafi, S. An Proposed Algorithm for Generating Criteria Necessary to Establish Congruence between Two Convex N-Sided Polygons in Euclidean Geometry. Preprints 2023, 2023030490. https://doi.org/10.20944/preprints202303.0490.v1
Rafi, S. An Proposed Algorithm for Generating Criteria Necessary to Establish Congruence between Two Convex N-Sided Polygons in Euclidean Geometry. Preprints2023, 2023030490. https://doi.org/10.20944/preprints202303.0490.v1
APA Style
Rafi, S. (2023). An Proposed Algorithm for Generating Criteria Necessary to Establish Congruence between Two Convex N-Sided Polygons in Euclidean Geometry. Preprints. https://doi.org/10.20944/preprints202303.0490.v1
Chicago/Turabian Style
Rafi, S. 2023 "An Proposed Algorithm for Generating Criteria Necessary to Establish Congruence between Two Convex N-Sided Polygons in Euclidean Geometry" Preprints. https://doi.org/10.20944/preprints202303.0490.v1
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
Keywords
Triangles; Geometry; Euclidean Geometry
Subject
Computer Science and Mathematics, Geometry and Topology
Copyright:
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
