Zerlegungsähnlichkeit von Polygonen. (Dissection-similarity of polygons) (Q1819370)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Zerlegungsähnlichkeit von Polygonen. (Dissection-similarity of polygons) |
scientific article; zbMATH DE number 3992319
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Zerlegungsähnlichkeit von Polygonen. (Dissection-similarity of polygons) |
scientific article; zbMATH DE number 3992319 |
Statements
Zerlegungsähnlichkeit von Polygonen. (Dissection-similarity of polygons) (English)
0 references
1986
0 references
The author gives an elementary proof of an n-dimensional polyhedron theorem of Debrunner in the case \(n=2\). It is shown that two arbitrary polygons can be divided into the same number of pairwise similar partpolygons. If the polygons are convex a good universal upper bound is given for the minimal number of the above partpolygons.
0 references
dissections of polygons
0 references
group of similarity transformations
0 references
0.8700917
0 references
