From a random polygon in \(\mathbb R^m\) to an ellipse: a Fourier analysis of iterated circular convolutions

DOI10.1007/s40819-017-0320-xzbMath1397.51006OpenAlexW2585370753MaRDI QIDQ1792228

Boyan Kostadinov

Publication date: 11 October 2018

Published in: International Journal of Applied and Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40819-017-0320-x

zbMATH Keywords

discrete Fourier transformpolygon smoothingcomplex and real representations of an ellipseiterated circular convolutionlimiting forms of convolved normalized random polygonsmultidimensional polygon averaging with normalization

Mathematics Subject Classification ID

Elementary problems in Euclidean geometries (51M04) Harmonic analysis in one variable (42A99)

Uses Software

• R

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Problem of uniform deployment on a line segment for second-order agents
• Convolution filters for polygons and the Petr-Douglas-Neumann theorem
• Formation control: the Van loan scheme and other algorithms
• A circulant formulation of the Napoleon-Douglas-Neumann theorem
• Cyclic transformations of n-gons and related quadratic forms
• Limiting forms of iterated circular convolutions of planar polygons
• The ubiquitous ellipse
• Iterative Processes in Elementary Geometry
• A Periodicity Problem in Plane Geometry
• Perpendicular Polygons
• Sequences of Polygons
• Cyclic Transformations of Polygons and the Generalized Inverse
• From Random Polygon to Ellipse: An Eigenanalysis
• A Polygon Problem
• The Finite Fourier Series and Elementary Geometry
• A Property of Linear Cyclic Transformations
• On linear polygon transformations

This page was built for publication: From a random polygon in \(\mathbb R^m\) to an ellipse: a Fourier analysis of iterated circular convolutions