BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
X-LIC-LOCATION:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260402T024534Z
LOCATION:3004\, Level 3
DTSTART;TZID=America/Los_Angeles:20250624T104500
DTEND;TZID=America/Los_Angeles:20250624T110000
UID:dac_DAC 2025_sess144_RESEARCH1985@linklings.com
SUMMARY:Constraint Graph-based PCB Legalization Considering Dense, Heterog
 eneous, Irregular-Shaped, and Any-Oriented Components
DESCRIPTION:Chiao-Yu Ou, Yan-Jen Chen, and Yao-Wen Chang (National Taiwan 
 University)\n\nIn modern printed circuit board (PCB) designs, the increasi
 ng complexity poses more challenges for automatic placement. Existing PCB 
 placement methods cannot handle complex constraints with heterogeneous, ir
 regular-shaped, and any-oriented components for double-sided PCB designs w
 ell. This paper proposes the first constraint graph-based legalization app
 roach for these constraints. We use a slicing technique to model a compone
 nt more accurately with a set of rectangles instead of resorting to the na
 ïve bounding box approximation. Unlike the commonly used linear programmin
 g method for macro placement in integrated circuit (IC) designs, we employ
  a mixed integer quadratic programming (MIQP) formulation to effectively e
 xpand the solution space for heterogeneous, irregular-shaped, and any-orie
 nted components, particularly with high-density designs. Experimental resu
 lts demonstrate the effectiveness and robustness of our work.\n\nTopics: E
 DA\n\nTracks: EDA7: Physical Design and Verification\n\nSession Chairs: An
 kur Prasad (Apple Inc.) and Yu-Guang Chen (National Central University)\n\
 n
END:VEVENT
END:VCALENDAR