A new unsupervised polygonal approximation algorithm that combines bidirectional length-scanning, iterative vertex insertion, merging, and vertex adjustment is reported to be faster than an existing method with comparable quality on MPEG7 shapes.
A new thresholding approach for automatic generation of polygonal approximations
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.GR 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
support 1representative citing papers
citing papers explorer
-
A Fast Unsupervised Scheme for Polygonal Approximation
A new unsupervised polygonal approximation algorithm that combines bidirectional length-scanning, iterative vertex insertion, merging, and vertex adjustment is reported to be faster than an existing method with comparable quality on MPEG7 shapes.