Search Results for ""

A polygon whose interior consists of all points in the plane which are closer to a particular lattice point than to any other. The generalization to n dimensions is called a ...

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

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

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

The tangential triangle is the triangle DeltaT_AT_BT_C formed by the lines tangent to the circumcircle of a given triangle DeltaABC at its vertices. It is therefore antipedal ...

The planes passing through the vertices of a tetrahedron ABCD and tangent to the circumsphere at these points form another tetrahedron called the tangential tetrahedron. The ...

For a plane curve, the tangential angle phi is defined by rhodphi=ds, (1) where s is the arc length and rho is the radius of curvature. The tangential angle is therefore ...