2014Unpublished venueRequires access

An algorithm of polygonal approximation constrained by the offset direction

Xiaojing Xuan, Fangmin Dong, Shuifa Sun, Bangjun Lei

Open publisher page 0 citations

Abstract

In view of the existing polygonal approximation algorithm of digital curves can't effectively solve the problem of polygonal approximation constrained by the offset direction, this paper proposes an algorithm of polygonal approximation constrained by the offset direction. First, the offset polygon of the original digital curve is calculated under the control of offset direction and distance. Second, the summation of the squared Euclidean distances between the vertices on the offset polygon and its corresponding segment in the approximated polygon is selected as the fitness function. Finally, under the control of the offset distance and fitness function, this paper implements a PSO-based polygonal approximation algorithm to approximate the offset polygon. Experiments show that the proposed method can not only satisfy the polygonal approximation with directional requirements, but also can greatly improve the operating efficiency.

About this research paper

What this paper is about

In view of the existing polygonal approximation algorithm of digital curves can't effectively solve the problem of polygonal approximation constrained by the offset direction, this paper proposes an algorithm of polygonal approximation constrained by the offset direction. First, the offset polygon of the original digital curve is calculated under the control of offset direction and distance. Second, the summation of the squared Euclidean distances between the vertices on the offset polygon and its corresponding segment in the approximated polygon is selected as the fitness function. Finally, under the control of the offset distance and fitness function, this paper implements a PSO-based polygonal approximation algorithm to approximate the offset polygon. Experiments show that the proposed method can not only satisfy the polygonal approximation with directional requirements, but also can greatly improve the operating efficiency.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In view of the existing polygonal approximation algorithm of digital curves can't effectively solve the problem of polygonal approximation constrained by the offset direction, this paper proposes an algorithm of polygonal approximation constrained by the offset direction. First, the offset polygon of the original digital curve is calculated under the control of offset direction and distance. Second, the summation of the squared Euclidean distances between the vertices on the offset polygon and its corresponding segment in the approximated polygon is selected as the fitness function. Finally, under the control of the offset distance and fitness function, this paper implements a PSO-based polygonal approximation algorithm to approximate the offset polygon. Experiments show that the proposed method can not only satisfy the polygonal approximation with directional requirements, but also can greatly improve the operating efficiency.

Key concepts: Offset (computer science), Polygon (computer graphics), Approximation algorithm, Algorithm, Euclidean distance, Polygonal chain, Computer science, Euclidean geometry

Related papers

Back to paper searchBrowse research topicsOriginal source
An algorithm of polygonal approximation constrained by the offset direction — Research Paper | ScholarLens