Search Results for ""

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 polygon whose vertices do not all lie in a plane.

The generalization of a Voronoi polygon to n dimensions for n>2.

A polygon vertex x_i of a simple polygon P is a principal polygon vertex if the diagonal [x_(i-1),x_(i+1)] intersects the boundary of P only at x_(i-1) and x_(i+1).

65537 is the largest known Fermat prime, and the 65537-gon is therefore a constructible polygon using compass and straightedge, as proved by Gauss. The 65537-gon has so many ...

A polygon P is said to be simple (or a Jordan polygon) if the only points of the plane belonging to two polygon edges of P are the polygon vertices of P. Such a polygon has a ...

257 is a Fermat prime, and the 257-gon is therefore a constructible polygon using compass and straightedge, as proved by Gauss. An illustration of the 257-gon is not included ...

A simple polygon with precisely two ears and one mouth.

A random polygon containing the origin (Kovalenko 1999).

A polygon whose vertex angles are equal (Williams 1979, p. 32).