Shape simplification through polygonal approximation in the fourier domain

• Main Authors: Andrews, Mark, Kakarala, Ramakrishna
• 其他作者: Röning, Juha
• 格式: Conference or Workshop Item
• 語言: English
• 出版: 2015
• 主題: DRNTU::Engineering::Computer science and engineering::Theory of computation::Analysis of algorithms and problem complexity
• 在線閱讀: https://hdl.handle.net/10356/106994; http://hdl.handle.net/10220/25238

Fourier descriptors have long been used to describe the underling continuous contours of two-dimensional shapes. Approximations of shapes by polygons is a natural step for efficient algorithms in computer graphics and computer vision. This paper derives mathematical relationships between the Fourier...