Search Results for ""

As defined by Kyrmse, a canonical polygon is a closed polygon whose vertices lie on a point lattice and whose edges consist of vertical and horizontal steps of unit length or ...

Let A, B, and C be three polar vectors, and define V_(ijk) = |A_i B_i C_i; A_j B_j C_j; A_k B_k C_k| (1) = det[A B C], (2) where det is the determinant. The V_(ijk) is a ...

A random polygon is a polygon generated in some random way. Kendall conjectured that the shape of a random polygon is close to a disk as the area of the polygon becomes large ...

A simple polygon with precisely two ears and one mouth.

The dual vector space to a real vector space V is the vector space of linear functions f:V->R, denoted V^*. In the dual of a complex vector space, the linear functions take ...

An equilateral polygon is a polygon whose edges are all of equal length (Williams 1979, pp. 31-32). The most prominent examples of equilateral polygons are the regular ...

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 ...

Given a planar graph G, its geometric dual G^* is constructed by placing a vertex in each region of G (including the exterior region) and, if two regions have an edge x in ...

A planar polygon is convex if it contains all the line segments connecting any pair of its points. Thus, for example, a regular pentagon is convex (left figure), while an ...

The Archimedean duals are the 13 duals of the 13 Archimedean solids, sometimes called the Catalan solids. They are summarized in the following table and illustrated below ...