Abstract: This paper proposes and implements a new method for typification of ditches with almost parallel pattern. In this method，azimuth relation graph of ditches is established first，by generating the maximum complete subgraph of the connected components in which ditches having almost parallel pattern are extracted then. Next，cognition distance between ditches is defined according to the lawsof visual cognition and then ditches are grouped based on the edge-cutting of the minimal spanning tree of ditches. Afterwards，ditches in each group are re-represented based on K-means+algorithm. Finally，typification result is evaluated through comparing the similarity between the contour of ditches and the variation of ditch density before and after typification. Experiment using data of Uuangzhoucity validates that the proposed method can implement the typification of ditches effectively.