Abstract: In this paper, a aquadratic-place algorithm based on dynamic partition—DPRR is addressed to solve the problem of placement in rectilinear region. It involves new policies of circle-partitioning and distribution-constraints generation into the traditional frame of quadratic-place and solves the problem of placement in rectilinear region properly. And its new approach for generating distribution constraints by dynamic partitioning allows cells moving freely among the sub-regions. Thus, it can result in better placement performance by somewhat avoiding the “local optimum”. Testing on cases proves that DPRR is an efficient algorithm for the standard cell placement in rectilinear region.