Efficient solution of systems of orientation constraints

One subtask in constraint-driven placement is enforcing a set of orientation constraints on the devices being placed. Such constraints are created in order to, for example, implement matching constraints or enforce regularity among members of an array of devices. Here we present an efficient algorithm for solving systems of discrete orientation constraints. The algorithm handles overconstraints by selectively relaxing constraints until the remaining set can all be simultaneously enforced. The algorithm runs in linear time in the absence of overconstraints.

• Type: Conference
• Year: 1999
• Where: ISPD
• Authors: Joseph L. Ganley
• Keywords: Hardware, Implement Matching Constraints, ISPD 1999, Orientation Constraints, Such Constraints