Abstract
An Augmented Line Segment-Based (ALSB) algorithm with delayed overlap consideration is proposed for the construction of Rectilinear Steiner Minimum Tree (RSMT). The algorithm incrementally augments the four line segments drawn from each point in four directions. When the line segments of two points interconnect, the edge connecting those two points is included to RSMT. The selection of the L-shaped layout is done after all the edges are identified. After the RSMT edges are selected, the two layouts of each edge are compared based on overlap count, and the layout with maximum overlap is added to RSMT, thereby reducing the total length of RSMT. RSMT has wide application in the field of VLSI during global routing.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
