2001
DOI: 10.1145/383251.383255
|View full text |Cite
|
Sign up to set email alerts
|

Constrained polygon transformations for incremental floorplanning

Abstract: A productivity-driven methodology for incremental floorplanning is described and the constrained polygon transformation problem, a key step of this methodology, is formulated. The input to the problem consists of a floorplan computed using area estimates and the actual area required for each subcircuit of the floorplan. Informally, the objective is to change the areas of the modules without drastically changing their shapes or locations. We show that the constrained polygon transformation problem is NP-hard an… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2003
2003
2013
2013

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(1 citation statement)
references
References 10 publications
0
1
0
Order By: Relevance
“…Y i differs from texture mapping as a result. Optimal packing of polygonal shapes in a 2D plane is an NP hard problem [35]. We can use a heuristic packing arrangement that attempts to utilize the quilt image space optimally.…”
Section: Packing Facets Into the Quilt Imagementioning
confidence: 99%
“…Y i differs from texture mapping as a result. Optimal packing of polygonal shapes in a 2D plane is an NP hard problem [35]. We can use a heuristic packing arrangement that attempts to utilize the quilt image space optimally.…”
Section: Packing Facets Into the Quilt Imagementioning
confidence: 99%