979 research outputs found

    Rectangular Layouts and Contact Graphs

    Get PDF
    Contact graphs of isothetic rectangles unify many concepts from applications including VLSI and architectural design, computational geometry, and GIS. Minimizing the area of their corresponding {\em rectangular layouts} is a key problem. We study the area-optimization problem and show that it is NP-hard to find a minimum-area rectangular layout of a given contact graph. We present O(n)-time algorithms that construct O(n2)O(n^2)-area rectangular layouts for general contact graphs and O(nlogn)O(n\log n)-area rectangular layouts for trees. (For trees, this is an O(logn)O(\log n)-approximation algorithm.) We also present an infinite family of graphs (rsp., trees) that require Ω(n2)\Omega(n^2) (rsp., Ω(nlogn)\Omega(n\log n)) area. We derive these results by presenting a new characterization of graphs that admit rectangular layouts using the related concept of {\em rectangular duals}. A corollary to our results relates the class of graphs that admit rectangular layouts to {\em rectangle of influence drawings}.Comment: 28 pages, 13 figures, 55 references, 1 appendi

    Routing congestion analysis and reduction in deep sub-micron VLSI design

    Get PDF
    Congestion is one of the main optimization objectives in global routing. However, the optimization performance is constrained because the cells are already fixed at this stage. Therefore, designer can save substantial time and resources by detecting and reducing congested regions during the planning stages. An efficient and yet accurate congestion estimation model is crucial to be included in the inner loop of floorplanning and placement design. In this dissertation, we mainly focus on routing congestion modeling and reduction during floorplanning and placement

    The Flip Diameter of Rectangulations and Convex Subdivisions

    Full text link
    We study the configuration space of rectangulations and convex subdivisions of nn points in the plane. It is shown that a sequence of O(nlogn)O(n\log n) elementary flip and rotate operations can transform any rectangulation to any other rectangulation on the same set of nn points. This bound is the best possible for some point sets, while Θ(n)\Theta(n) operations are sufficient and necessary for others. Some of our bounds generalize to convex subdivisions of nn points in the plane.Comment: 17 pages, 12 figures, an extended abstract has been presented at LATIN 201
    corecore