Equidissection Equidissection In geometry, an equidissection is a partition of a polygon into triangles of equal area. The study of equidissections began in the late 1960s with Monsky's theorem, which states that a square cannot be equidissected into an odd number of triangles. In fact, most polygons cannot be equidissected at all. Much of the literature is aimed at generalizing Monsky's theorem to broader classes of polygons. The general question is: Which polygons can be equidissected into how many pieces? Particular attention has been given to trapezoids, kites, regular polygons, centrally symmetric polygons, polyominos, and hypercubes. Equidissections do not have many
Geometry pipelines to the vertices of polygons, or other geometric objects used as modelling primitives, as part of the first stage in a classical geometry-based graphic image rendering pipeline. Geometric computations may also be applied to transform polygon or repair surface normals, and then to perform the lighting and shading computations used in their subsequent rendering. Hardware implementations of the geometry pipeline were introduced in the early Evans & Sutherland Picture System, but perhaps received broader recognition when later applied in the broad range of graphics systems products introduced by Silicon Graphics (SGI). Initially the SGI geometry hardware performed simple model space