Abstract:

This paper proposes a morphing approach for linear features by sufficiently considering their independent bend structures. First, the bend structures of the linear features are identified based on a constrained Delaunay triangulation (CDT) model, and represented by bend forest. Second, corresponding bends are determined by bend matching. One can find that some independent bend structures are hided in the higher-level bends. Therefore, the CDT model is iteratively used for corresponding bends and new bend forests of the back-side are built, so that bend matching is iteratively utilized to detect new corresponding bends. After bend matching, the starts and ends of corresponding bends are used to split the linear features so that corresponding segments are obtained. In succession, linear interpolation algorithm is utilized to detect corresponding points and straight-line trajectories are used for morphing. Finally, the experiments are implemented. The results show that the approach proposed in this paper can improve the ability to detect the characteristic points of corresponding bends and to maintain these characteristic points in the morphing process. As a result, this approach can produce better morphing results.

Key words: Morphing, shape interpolation, bends, linear features, cartographic generalization