n-gon

It can easily be shown that this is again a generalized n-gon.

In this way, one associates numbers to an n-gon.

Every generalized n-gon with n even is also a near polygon.

An is a regular n-gon and P is an arbitrary point in the plane.

He proved that there are at most unit distances in a convex n-gon.

It is also called a cyclic graph, a polygon or the n-gon.

An apartment of a generalized n-gon is a cycle of length 2n.

The first several members do indeed have the geometry of a regular prism, with flat n-gon bases.

Thus, there are 2N flags associated to an N-gon.

Among graph theorists, cycle, polygon, or n-gon are also often used.

An n-gon is an equilateral shape composed of curved or straight line segments.

A root of a generalized n-gon is a path of length n.

The map M is called the monodromy of the twisted N-gon.

It has an ordinary n-gon as a subgeometry.

Each polygon fills a hemisphere, with a regular n-gon on a great circle equator between them.

Examples of groups, including the group of symmetries of a regular n-gon.

Taking one period of this sequence identifies a twisted N-gon with a point in where F is the underlying field.

A generalized n-gon is a bipartite graph of diameter n and girth 2n.

The dual n-gonal antiprism has two actual n-gon faces.

By surjectivity of the representation these generators must map to reflections of a regular n-gon.

The quantity n gives the order of the symmetry (that of a regular n-gon) and must be an integer.

The measure of any interior angle of a convex regular n-gon is radians or degrees.

Tracing around a convex n-gon, the angle "turned" at a corner is the exterior or external angle.

Next you will be asked for a rotation angle for the base of the N-GON.

For any there exists a subgeometry () isomorphic to an ordinary n-gon such that .