Self-affine convex polygons (Q622549): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s00022-010-0054-y / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1967778338 / rank | |||
Normal rank |
Revision as of 01:35, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Self-affine convex polygons |
scientific article |
Statements
Self-affine convex polygons (English)
0 references
3 February 2011
0 references
Two plane figures are equivalent via an affine transformation if one can be mapped bijectively onto the other using an invertible linear transformation and a translation. The paper investigates the problem of classifying convex polygons in \(\mathbb{R}^2\) which can be dissected into 2 or more pieces each of which is equivalent to the original polygon via an affine transformation. Such polygons are called self-affine. It is remarked that every triangle is self-affine. It is proven that every convex quadrangle is self-affine and provided that this quadrangle is not a parallelogram, any polygon can be tiled by finitely many affine images of it. It is shown that the regular pentagon is not self-affine. An example of a self-affine convex pentagon is presented.
0 references
Convex polygon
0 references
self-affine
0 references
self-similar
0 references
tiling
0 references