Algorithm for the construction of Rectilinear Steiner Minimum Tree by identifying the clusters of points

The proposed algorithm constructs Rectilinear Steiner Minimum Tree (RSMT) by applying clustering algorithm to identify the required number of cluster of points and then applies a strategy to construct RSMT for each of the cluster. The clusters are then interconnected to get the final RSMT. The constructed RSMT produces improvement over Rectilinear Minimum Spanning Tree in terms of wire length reduction. RSMT are widely used in the global routing phase of VLSI design and wire length reduction.