Search Results for ""

Let O be an incidence geometry, i.e., a set with a symmetric, reflexive binary relation I. Let e and f be elements of O. Let an incidence plane be an incidence geometry whose ...

The diameter of a polygon is the largest distance between any pair of vertices. In other words, it is the length of the longest polygon diagonal (e.g., straight line segment ...

The polygon formed by the lines tangent to the circumcircle of a polygon. The tangential polygon of an n-gon is itself an n-gon.

A point at which two polygon edges of a polygon meet.

The number q in a star polygon {p/q}.

A concave polygon is a polygon that is not convex. A simple polygon is concave iff at least one of its internal angles is greater than 180 degrees. An example of a non-simple ...

A generalized hexagon is a generalized polygon of order 6. GH(1,2) is more commonly known as the Heawood graph, but is also the (3,6)-cage graph, the cubic vertex-transitive ...

The generalized diameter is the greatest distance between any two points on the boundary of a closed figure. The diameter of a subset E of a Euclidean space R^n is therefore ...

A generalized octagon GO(n,k) is a generalized polygon of order 8. GO(1,2) is the (3,8)-cage graph, the incidence graph of the Cremona-Richmond configuration, the cubic ...

A generalized dodecagon is a generalized polygon of order 12. GD(1,2) is the (3,12)-cage graph, more commonly known as the Tutte 12-cage. GD(2,1) is the line graph of the ...