A FAST ALGORITHM FOR AUTOMATED LABELING CONTOUR MAP

In this paper, the general principles of automated labeling contour map and representation of contour by means of graph theory are first discussed. And then, based on the algorithm of Sircar and Cebrian, a fast and practical algorithm for automated labeling contour is provided. The kernel of this algorithm includes three aspects: large region filling instead of eight-neighbor-based region tagging, fast contour tree generating, and conflict checking in the process of tree searching.