[go: up one dir, main page]

Daniels et al., 1993 - Google Patents

Finding the maximum area axis-parallel rectangle in a polygon.

Daniels et al., 1993

View PS
Document ID
5644566817253671921
Author
Daniels K
Milenkovic V
Roth D
Publication year
Publication venue
CCCG

External Links

Snippet

We consider the geometric optimization problem of nding the maximum area axis-parallel rectangle (MAAPR) in an n-vertex general polygon. We characterize the MAAPR for general polygons by considering di erent cases based on the types of contacts between the …
Continue reading at cogcomp.seas.upenn.edu (PS) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5068—Physical circuit design, e.g. layout for integrated circuits or printed circuit boards
    • G06F17/5077—Routing
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5068—Physical circuit design, e.g. layout for integrated circuits or printed circuit boards
    • G06F17/5081—Layout analysis, e.g. layout verification, design rule check
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5009—Computer-aided design using simulation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor

Similar Documents

Publication Publication Date Title
Daniels et al. Finding the largest area axis-parallel rectangle in a polygon
Ousterhout et al. The magic VLSI layout system
Sherwani Algorithms for VLSI physical design automation
Cong et al. An implicit connection graph maze routing algorithm for ECO routing
US5533148A (en) Method for restructuring physical design images into hierarchical data models
Hu et al. A survey on multi-net global routing for integrated circuits
US20050237321A1 (en) Grid canvas
Marple et al. Tailor: A layout system based on trapezoidal corner stitching
JP2009087376A (en) Method and apparatus for interconnection
Taylor et al. Magic's incremental design-rule checker
Chan et al. Practical slicing and non-slicing block-packing without simulated annealing
Garg et al. Area-efficient upward tree drawings
Daniels et al. Finding the maximum area axis-parallel rectangle in a polygon.
Dai et al. A dynamic and efficient representation of building-block layout
Heath Algorithms for embedding graphs in books
Igusa et al. ORCA A sea-of-gates place and route system
Pinter The impact of layer assignment methods on layout algorithms for integrated circuits
Eades et al. Drawing clustered graphs on an orthogonal grid
Garg et al. Straight-line drawings of binary trees with linear area and arbitrary aspect ratio
Daniels et al. Finding the largest rectangle in several classes of polygons
Raitner Visual navigation of compound graphs
Lai et al. Hinted quad trees for VLSI geometry DRC based on efficient searching for neighbors
Müller-Hannemann Drawing trees, series-parallel digraphs, and lattices
Eades et al. Orthogonal grid drawing of clustered graphs
Nandy et al. Dual quadtree representation for VLSI designs