What is an n-Gon?

In EPG (Encyclopedia of Polygon Geometry) an n-Gon is defined as a bounded figure consisting of ‘n’ random points occurring in a plane and ‘n’ lines connecting these points in a cycle, where a cycle and its reverse cycle are supposed to be the same cycle. This system is often presented as a bounded convex figure, however the figure is not necessarily convex or concave. There are no limitations in this.
This figure is often popularly called a Polygon.
The only difference between an n-Point and an n-Gon is that there is a fixed order in the defining points of the n-Point. Subsequently the edges (lines) between the subsequent points can be drawn as part of the n-Gon. An n-Point contains (n-1)!/2 different n-Gons. See nG-1.
The only difference between an n-Line and an n-Gon is that there is a fixed order in the defining lines of the n-Line. Subsequently the (intersection) points of the defining lines can be drawn as part of the n-Gon. An n-Line contains (n-1)!/2 different n-Gons. See nG-1.

A Polygon is a flexible framework that can be used to construct many specific objects.

Because the order of points and lines are known terms like "opposite" and "adjacent" play an important role in a Quadrigon.
In EPG these objects often will be prefixed with “nG-”.

Related to a Quadrigon several point, lines, circles, conics, cubics, transformations and triangles do exist, which can be obtained from the pulldown menu at the left of this page.

<--------