Abstract: Techniques described herein are used to identify buildings that intersect or otherwise overlap a road, and independently scaling the buildings until they no longer overlap. For example, a computer system may identify an intersection condition corresponding to an intersection between a first polygon of a first type and a second polygon of a second type. The first polygon may include a set of edges connected by a set of vertexes. The computer system may select a first pivot point for the first polygon, which includes a vertex of the set of vertexes or a midpoint of one edge of the set of edges. The computer system may perform an iterative scaling operation. The computer system may determine, based on the iterative scaling operation, a polygon transformation that avoids the intersection condition. The computer system may cause rendering, on a display, of a map view that includes the polygon transformation.