Abstract: A method for scanning a semiconductor layout, the layout comprising objects with edges and corners, the method comprising identifying locally closest point pairs, identifying a proximity relation between two parallel edges where the parallel edges have at least one locally closest point pair in common and storing the proximity relation in a proximity relations table of a database together with a reference to the corresponding pair of edges. Locally closest point pairs are identified where the first edge and the second edge are not in contact with each other, a distance between the first point and the second point is the shortest distance between the first edge and the second edge, and a convex bounding area with the first point and the second point on its boundary contains no edge.

Abstract: The invention relates to a layout modification engine (18) for modifying a circuit layout (1) comprising layout entities including a fixed layout entity and free layout entities. The layout entities are a representation of at least part of an integrated circuit, each layout entity comprises at least one layout element. The fixed layout entity is restrained to a predefined position. The layout modification engine comprises the conflict-solver for resolving conflicts between the fixed layout entity and the free layout entities. The conflict-solver comprises a layout analyzer (14) and a conflict-solving-module (16). The conflict-solving module generates a set of fixed layout elements for resolving the detected conflict. Because the layout modification engine converts the fixed layout entity into the set of fixed layout elements, the layout modification engine will encounter less conflict situations while modifying the circuit layout which reduces the processing time.

Abstract: A method for scanning a semiconductor layout, the layout comprising objects with edges and corners, the method comprising identifying locally closest point pairs, identifying a proximity relation between two parallel edges where the parallel edges have at least one locally closest point pair in common and storing the proximity relation in a proximity relations table of a database together with a reference to the corresponding pair of edges. Locally closest point pairs are identified where the first edge and the second edge are not in contact with each other, a distance between the first point and the second point is the shortest distance between the first edge and the second edge, and a convex bounding area with the first point and the second point on its boundary contains no edge.