Convolution filters for polygons and the Petr–Douglas–Neumann theorem

We use the discrete Fourier transformation of planar polygons, convolution filters, and a shape function to give a very simple and enlightening description of circulant polygon transformations and their iterates. We consider in particular Napoleon’s and the Petr–Douglas–Neumann theorem.

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Beiträge zur Algebra und Geometrie 2013-10, Vol.54 (2), p.701-708
1. Verfasser:	Nicollier, Grégoire
Format:	Artikel
Sprache:	eng
Schlagworte:	Algebra Algebraic Geometry Convex and Discrete Geometry Geometry Mathematics Mathematics and Statistics Original Paper
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	We use the discrete Fourier transformation of planar polygons, convolution filters, and a shape function to give a very simple and enlightening description of circulant polygon transformations and their iterates. We consider in particular Napoleon’s and the Petr–Douglas–Neumann theorem.
ISSN:	0138-4821 2191-0383
DOI:	10.1007/s13366-013-0143-9