Shape simplification through polygonal approximation in the fourier domain

• المؤلفون الرئيسيون: 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
• المؤسسة: Nanyang Technological University

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...