Feature selection is a key problem of matching 2D polygonal arcs. The optimal feature sets should have the attribute of geometry and topology. In this paper

we focus on polygonal arcs junction that is two line segments that meet at a single point. We present junctions of polygonal arcs as feature sets; the benefits of using this feature sets include attribute of geometry and structure of topology of polygonal arcs. The number of features used in the matching must be reducing to a minimum without losing geometric information useful for 2D reconstruction. 2D polygonal arcs are represented by the feature sets. This representation is invariant to translation and rotation transformation. The 2D polygonal arcs matching task is reduce into a 1 D string matching problem. The trivial matching algorithm is proposed and use to matching of nonoccluded and occluded 2D polygonal arcs. Experiments with different classes polygonal arcs show that the matching algorithm is efficiency and is robust to digitization errors and noise effects. And can perform well when simple closed curves represented by polygonal arcs.