✳flâneur — a map of the web's best reading

Dissection problem

en.wikipedia.org · 595 words · saved by 1 readers

In geometry, a dissection problem is the problem of partitioning a geometric figure (such as a polytope 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. For instance, they may be restricted to being the closures of disjoint open sets.

Dissection problem - Wikipedia Jump to content From Wikipedia, the free encyclopedia Geometric problems involving the partition of a figure In geometry , a dissection problem is the problem of partitioning a geometric figure (such as a polytope 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

Explore this link on the map →

related reading