Region definition and ordering assignment with the minimization of the number of switchboxes

Abstract

In this paper, a region definition and ordering assignment (RDAOA) algorithm for minimizing the number of switchboxes is proposed. The time complexity of the algorithm is proved to be in O(n) time, where n is the number of line segments in a given floorplan graph. Finally, several examples have been tested on the proposed algorithm and other published algorithms, and the experimental results show that our algorithm defines fewer switchboxes than other algorithms.