Matches in DBpedia 2014 for { ?s ?p 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. The Bolyai-Gerwien theorem states that any polygon may be dissected into any other polygon of the same area.. }
Showing items 1 to 1 of
1
with 100 items per page.
- Dissection_problem comment "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. The Bolyai-Gerwien theorem states that any polygon may be dissected into any other polygon of the same area.".