In
geometry
Geometry (; ) is, with arithmetic, one of the oldest branches of mathematics. It is concerned with properties of space such as the distance, shape, size, and relative position of figures. A mathematician who works in the field of geometry is c ...
, a dissection problem is the problem of partitioning a geometric
figure (such as a
polytope
In elementary geometry, a polytope is a geometric object with flat sides ('' faces''). Polytopes are the generalization of three-dimensional polyhedra to any number of dimensions. Polytopes may exist in any general number of dimensions as an ...
or
ball) into smaller pieces that may be rearranged into a new figure of equal content. In this context, the partitioning is called simply a dissection (of one polytope into another). It is usually required that the dissection use only a finite number of pieces. Additionally, to avoid
set-theoretic issues related to the
Banach–Tarski paradox and
Tarski's circle-squaring problem, the pieces are typically required to be
well-behaved
In mathematics, when a mathematical phenomenon runs counter to some intuition, then the phenomenon is sometimes called pathological. On the other hand, if a phenomenon does not run counter to intuition,
it is sometimes called well-behaved. T ...
. For instance, they may be restricted to being the
closures of disjoint
open set
In mathematics, open sets are a generalization of open intervals in the real line.
In a metric space (a set along with a distance defined between any two points), open sets are the sets that, with every point , contain all points that a ...
s.
The
Bolyai–Gerwien theorem states that any
polygon
In geometry, a polygon () is a plane figure that is described by a finite number of straight line segments connected to form a closed '' polygonal chain'' (or ''polygonal circuit''). The bounded plane region, the bounding circuit, or the two t ...
may be dissected into any other polygon of the same area, using interior-disjoint polygonal pieces. It is not true, however, that any
polyhedron
In geometry, a polyhedron (plural polyhedra or polyhedrons; ) is a three-dimensional shape with flat polygonal faces, straight edges and sharp corners or vertices.
A convex polyhedron is the convex hull of finitely many points, not all on ...
has a dissection into any other polyhedron of the same volume using polyhedral pieces (see
Dehn invariant). This process ''is'' possible, however, for any two
honeycombs
A honeycomb is a mass of hexagonal prismatic wax cells built by honey bees in their nests to contain their larvae and stores of honey and pollen.
Beekeepers may remove the entire honeycomb to harvest honey. Honey bees consume about of hone ...
(such as
cube
In geometry, a cube is a three-dimensional solid object bounded by six square faces, facets or sides, with three meeting at each vertex. Viewed from a corner it is a hexagon and its net is usually depicted as a cross.
The cube is the on ...
) in three dimension and any two
zonohedra
In geometry, a zonohedron is a convex polyhedron that is centrally symmetric, every face of which is a polygon that is centrally symmetric (a zonogon). Any zonohedron may equivalently be described as the Minkowski sum of a set of line segments in ...
of equal volume (in any dimension).
A dissection into
triangle
A triangle is a polygon with three edges and three vertices. It is one of the basic shapes in geometry. A triangle with vertices ''A'', ''B'', and ''C'' is denoted \triangle ABC.
In Euclidean geometry, any three points, when non- colli ...
s of equal area is called an
equidissection. Most polygons cannot be equidissected, and those that can often have restrictions on the possible numbers of triangles. For example,
Monsky's theorem
In geometry, Monsky's theorem states that it is not possible to dissect a square into an odd number of triangles of equal area. In other words, a square does not have an odd equidissection.
The problem was posed by Fred Richman in the ''Ameri ...
states that there is no odd equidissection of a
square
In Euclidean geometry, a square is a regular quadrilateral, which means that it has four equal sides and four equal angles (90-degree angles, π/2 radian angles, or right angles). It can also be defined as a rectangle with two equal-length a ...
.
See also
*
Dissection puzzle
A dissection puzzle, also called a transformation puzzle or ''Richter Puzzle'', is a tiling puzzle where a set of pieces can be assembled in different ways to produce two or more distinct geometric shapes. The creation of new dissection puzzles ...
*
Hilbert's third problem
The third of Hilbert's list of mathematical problems, presented in 1900, was the first to be solved. The problem is related to the following question: given any two polyhedra of equal volume, is it always possible to cut the first into finitely ...
*
Hinged dissection
References
External links
*
David EppsteinDissection Tiling
Discrete geometry
Euclidean geometry
Geometric dissection
Polygons
Polyhedra
Polytopes
Mathematical problems
{{geometry-stub