Search Results for ""

The problem of polygon intersection seeks to determine if two polygons intersect and, if so, possibly determine their intersection. For example, the intersection of the two ...

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

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

Beautiful patterns can be created by drawing sets of nested polygons such that the incircle of the nth polygon is the circumcircle of the (n+1)st and successive polygons are ...

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

Given a sequence {a_k}_(k=1)^n, a partial sum of the first N terms is given by S_N=sum_(k=1)^Na_k.

The biggest little polygon with n sides is the convex plane n-gon of unit polygon diameter having largest possible area. Reinhardt (1922) showed that for n odd, the regular ...

The sum of sets A and B in a vector space, equal to {a+b:a in A,b in B}.

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

A plot of the cumulative frequency against the upper class boundary with the points joined by line segments. Any continuous cumulative frequency curve, including a cumulative ...