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...
Main Authors: | Andrews, Mark, Kakarala, Ramakrishna |
---|---|
Other Authors: | Röning, Juha |
Format: | Conference Paper |
Language: | English |
Published: |
2015
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/106994 http://hdl.handle.net/10220/25238 |
Similar Items
-
Multi-agent path finding (part B)
by: Cao, Lifeng
Published: (2020) -
Weighted online sequential extreme learning machine for class imbalance learning
by: Lin, Zhiping, et al.
Published: (2013) -
Efficient cyclic routing of unmanned aerial vehicles
by: Ong, Chao Jian
Published: (2018) -
Heuristic control of multiple batch processors with incompatible job families and future job arrivals
by: Tajan, John Benedict C., et al.
Published: (2013) -
EasyPDP: an efficient parallel dynamic programming runtime system for computational biology
by: Tang, Shanjiang, et al.
Published: (2013)