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

DOI10.1007/s13366-013-0143-9zbMath1287.51013OpenAlexW1969503517MaRDI QIDQ375940

Grégoire Nicollier

Publication date: 1 November 2013

Published in: Beiträge zur Algebra und Geometrie (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13366-013-0143-9

zbMATH Keywords

discrete Fourier transformationshape functionconvolution filter for polygonsNapoleon's theoremPetr-Douglas-Neumann theorem

Mathematics Subject Classification ID

Elementary problems in Euclidean geometries (51M04) Low-dimensional dynamical systems (37E99) Euclidean analytic geometry (51N20)

Related Items (6)

Regularizing transformations of polygons ⋮ A characterization of affinely regular polygons ⋮ Regularizing quadrangles in the Möbius plane ⋮ How Bürgi computed the sines of all integer angles simultaneously in 1586 ⋮ Limiting forms of iterated circular convolutions of planar polygons ⋮ From a random polygon in \(\mathbb R^m\) to an ellipse: a Fourier analysis of iterated circular convolutions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Triangles. III: Complex triangle functions
• A circulant formulation of the Napoleon-Douglas-Neumann theorem
• On converses of Napoleon's theorem and a modified shape function
• On the theorem of Napoleon and related topics
• Triangles. I: Shapes
• Limit shape of iterated Kiepert triangles
• Triangles. II: Complex triangle coordinates
• A Periodicity Problem in Plane Geometry
• Perpendicular Polygons
• A Polygon Problem
• A Remark on Polygons
• A Remark on Polygons
• The Finite Fourier Series and Elementary Geometry
• Some Remarks on Polygons†

This page was built for publication: Convolution filters for polygons and the Petr-Douglas-Neumann theorem