Search Results for ""

Let the squares square ABCD and square AB^'C^'D^' share a common polygon vertex A. The midpoints Q and S of the segments B^'D and BD^' together with the centers of the ...

A rotor is a convex figure that can be rotated inside a polygon (or polyhedron) while always touching every side (or face). The least area rotor in a square is the Reuleaux ...

The tangram is a combination of plane polygonal pieces such that the edges of the polygons are coincident. There are 13 convex tangrams (where a "convex tangram" is a set of ...

The generalized Petersen graph GP(n,k), also denoted P(n,k) (Biggs 1993, p. 119; Pemmaraju and Skiena 2003, p. 215), for n>=3 and 1<=k<=|_(n-1)/2_| is a connected cubic graph ...

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 which has both a circumcircle (which touches each vertex) and an incircle (which is tangent to each side). All triangles are bicentric with R^2-x^2=2Rr, (1) where R ...

Let a convex cyclic polygon be triangulated in any manner, and draw the incircle to each triangle so constructed. Then the sum of the inradii is a constant independent of the ...

The happy end problem, also called the "happy ending problem," is the problem of determining for n>=3 the smallest number of points g(n) in general position in the plane ...

The (signed) area of a planar non-self-intersecting polygon with vertices (x_1,y_1), ..., (x_n,y_n) is A=1/2(|x_1 x_2; y_1 y_2|+|x_2 x_3; y_2 y_3|+...+|x_n x_1; y_n y_1|), ...

A regular polygram {n/k} is generalization of a (regular) polygon on n sides (i.e., an n-gon) obtained by connecting every ith vertex around a circle with every (i+k)th, ...