Abstract: Optimal-matching point is used as the datum point to recognize planar polygons. Five adjacent vertices of the polygon are used to construct cross-ratio, which makes up the object's eigenvector. Local-unit vector is used to seek optimal-matching point. It also can judge the object's incompleteness or losing vertex. Experimental results show that the method has little computational complexity and stable performance, especially for the local incomplete objects.