Method and apparatus for computing capacity of a region for non-Manhattan routing
First Claim
1. For a router that allows routing in at least one non-Manhattan direction, said router partitioning a region of a layout into a plurality of sub-regions, said router defining routes that traverse said sub-regions, a method of computing a capacity for non-Manhattan routing in the region, the method comprising:
- a) identifying a polygon within the region, wherein the polygon has at least one side that is not aligned with a Manhattan direction, wherein the polygon is not one of the sub-regions;
b) identifying a set of potential obstacles within the polygon; and
c) calculating the capacity of the region for non-Manhattan routing, based on the identified set of potential obstacles.
1 Assignment
0 Petitions
Accused Products
Abstract
For a router that allows routing in at least one non-Manhattan direction, some embodiments of the invention provide a method of computing a capacity for non-Manhattan routing in a region. The method identifies a polygon about the region, where the polygon has at least one side that is not aligned with either Manhattan direction. It then identifies a set of potential obstacles within the polygon. The method then calculates the capacity of the region for non-Manhattan routing, based on the identified set of potential obstacles.
183 Citations
20 Claims
-
1. For a router that allows routing in at least one non-Manhattan direction, said router partitioning a region of a layout into a plurality of sub-regions, said router defining routes that traverse said sub-regions, a method of computing a capacity for non-Manhattan routing in the region, the method comprising:
-
a) identifying a polygon within the region, wherein the polygon has at least one side that is not aligned with a Manhattan direction, wherein the polygon is not one of the sub-regions; b) identifying a set of potential obstacles within the polygon; and c) calculating the capacity of the region for non-Manhattan routing, based on the identified set of potential obstacles. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. A computer readable medium that stores a computer program that computes a capacity for non-Manhattan routing in a region of a layout for a router that allows routing in at least one non-Manhattan direction, said router partitioning the region of the layout into a plurality of sub-regions, said router defining routes that traverse said sub-regions, the computer program comprising sets of instructions for:
-
a) identifying a polygon within the region, wherein the polygon has at least one side that is not aligned with a Manhattan direction, wherein the polygon is not one of the sub-regions; b) identifying a set of potential obstacles within the polygon; and c) calculating the capacity of the region for non-Manhattan routing, based on the identified set of potential obstacles. - View Dependent Claims (12, 13, 14, 15, 16, 17, 18, 19, 20)
-
Specification