Convolution filters for polygons and the Petr–Douglas–Neumann theorem
Rent the article at a discount
Rent now
* Final gross prices may vary according to local VAT.
Get Access
Abstract
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.
Keywords
Petr–Douglas–Neumann theorem
Napoleon’s theorem
Convolution filter for polygons
Shape function
Discrete Fourier transformation
