Skip to main content
Log in

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

  • Original Paper
  • Published:
Beiträge zur Algebra und Geometrie / Contributions to Algebra and Geometry Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price includes VAT (Finland)

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Grégoire Nicollier.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nicollier, G. Convolution filters for polygons and the Petr–Douglas–Neumann theorem. Beitr Algebra Geom 54, 701–708 (2013). https://doi.org/10.1007/s13366-013-0143-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13366-013-0143-9

Keywords

Mathematics Subject Classification (2000)

Navigation