SWEEPLINE TRIANGULATION FOR SPANNING GRAPHS

WIPO Patent Application WO/2023/036031

A1

Systems and methods for implementing a sweepline triangulation technique to optimize spanning graphs for circuit routing are provided. A non-limiting example computer-implemented method includes receiving an unrouted net having a plurality of elements. The elements can include pins, vias, and wires. A sweepline is passed across the unrouted net until the sweepline intersects an element of the plurality of elements. In response to the sweepline intersecting the element, the sweepline is stopped and one or more nodes on the sweepline and one or more previous nodes are identified. A connectivity graph is built from the one or more nodes and the one or more previous nodes. The connectivity graph includes one or more arcs and one or more guides. A minimum spanning tree is built by removing one or more guides from the connectivity graph and the unrouted net is routed based on the minimum spanning tree.

PANDEY DIWESH (IN)
TELLEZ GUSTAVO ENRIQUE (US)

PCT/CN2022/116131

March 16, 2023

August 31, 2022

Click for automatic bibliography generation  

IBM (US)
IBM CHINA CO LTD (CN)

H04N1/047

US20110307838A1	2011-12-15
CN109474476A	2019-03-15
US20180246309A1	2018-08-30

XIE GUANGQIAN; OTA KAORU; DONG MIANXIONG; PAN FENG; LIU ANFENG: "Energy-efficient routing for mobile data collectors in wireless sensor networks with obstacles", PEER-TO-PEER NETWORKING AND APPLICATIONS, SPRINGER, US, vol. 10, no. 3, 12 November 2016 (2016-11-12), US , pages 472 - 483, XP036162639, ISSN: 1936-6442, DOI: 10.1007/s12083-016-0529-1

ZHONGZI LAW OFFICE (CN)

View/Download PDF      PDF Help

Previous Patent: CONCURRENT TLS DATA STREAMS USING A SINGLE HANDSHAKE

Next Patent: LANE LINE DETECTION METHOD AND APPARATUS