Abstract: Displacement, deformation and symbolization of roads in maps usually results in spatial conflicts between roads and the surrounding buildings. The algorithm proposed in this paper resolves spatial conflicts between roads and buildings collaboratively, by means of transforming buildings displacement into linear feature displacement. The algorithm maintains the pattern of buildings along roads. The reasonability and availability of the algorithm was verified by a test. In this algorithm, spatial conflict areas are detected, and types of conflicts identified based on cartographic features in these areas. Buildings inside the areas are detected, and buildings close to detected buildings inside each conflict area and not far from a threshold value are distinguished from other buildings. Perpendiculars from each building center to a road are calculated and regarded as connections between buildings and roads. A minimum spanning tree (MST)for the centers of found buildings is established. The MST, perpendiculars and roads constitute a linear network, and a Snake model is used to analyze the collaborative displacement of this network.