Shape simplification through polygonal approximation in the fourier domain

Shape simplification through polygonal approximation in the fourier domain

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

Full description

Bibliographic Details
Main Authors: Andrews, Mark, Kakarala, Ramakrishna
Other Authors: Röning, Juha
Format: Conference Paper
Language:English
Published: 2015
Subjects:
DRNTU::Engineering::Computer science and engineering::Theory of computation::Analysis of algorithms and problem complexity
Online Access:https://hdl.handle.net/10356/106994
http://hdl.handle.net/10220/25238

Internet

https://hdl.handle.net/10356/106994
http://hdl.handle.net/10220/25238

Similar Items