Convolution filters for polygons and the Petr-Douglas-Neumann theorem
From MaRDI portal
Publication:375940
DOI10.1007/s13366-013-0143-9zbMath1287.51013MaRDI QIDQ375940
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
discrete Fourier transformation; shape function; convolution filter for polygons; Napoleon's theorem; Petr-Douglas-Neumann theorem
51M04: Elementary problems in Euclidean geometries
37E99: Low-dimensional dynamical systems
51N20: Euclidean analytic geometry
Related Items
A characterization of affinely regular polygons, 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, Regularizing quadrangles in the Möbius plane, Regularizing transformations of polygons
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†
