An Application of the c-Varieties Clustering Algorithm to Polygonal Curve

Document Type

Article

Journal/Book Title/Conference

IEEE Transactions on Systems, Man, and Cybernetics

Volume

15

Publication Date

1985

First Page

637

Last Page

641

Abstract

An algorithm is described that fits boundary data of planar shapes in either rectangular coordinate or chain-code format with a set of straight line segments. The algorithm combines a new vertex detection method, which locates initial vertices and segments in the data, with the c -elliptotype clustering algorithm, which iteratively adjusts the location of these initial segments, thereby obtaining a best polygonal fit for the data in the mean-squared error sense. Several numerical examples are given to exemplify the implementation and utility of this new approach.

Link to Full Text

Share

COinS