Optimal cutting directions and rectangle orientation algorithm
The first stage in hierarchical approaches to Floorplan Design defines topological relations between components that intend to optimize a given objective in a circuit board. These relations determine a placement that is subsequently optimized in order to minimize a cost measurement (that will probab...
Gespeichert in:
| Veröffentlicht in: | European journal of operational research 1998-09, Vol.109 (3), p.660-671 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 671 |
|---|---|
| container_issue | 3 |
| container_start_page | 660 |
| container_title | European journal of operational research |
| container_volume | 109 |
| creator | Almeida, A.M.C. Martins, Ernesto Q.V. Rodrigues, Rosália D. |
| description | The first stage in hierarchical approaches to Floorplan Design defines topological relations between components that intend to optimize a given objective in a circuit board. These relations determine a placement that is subsequently optimized in order to minimize a cost measurement (that will probably be one between chip area or perimeter). The board optimization gives rise to multiple subproblems that need to be answered in order to obtain a good solution. Among the most relevant ones we find the problem of defining the optimal orientation of cells and the definition of the optimal cutting sequence that minimize the placement board area. We will present a generalization of an algorithm due to Stockmeyer so that it obtains a solution that not only defines the optimal cell orientation but also the slicing cuts sequence that will lead to this optimal orientation and overall area minimization. |
| doi_str_mv | 10.1016/S0377-2217(97)00085-4 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_204184657</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0377221797000854</els_id><sourcerecordid>44053903</sourcerecordid><originalsourceid>FETCH-LOGICAL-c478t-a54eef39cca3c3b4f369833cd10e4a9203adfe98ed40248592b55cf101bf75d73</originalsourceid><addsrcrecordid>eNqFkU1P3DAQhi0EUrfQn1ApQj2UQ1o7_r6AEOqXisQBera8zmTxKpuktheJf8-EoL1iaTwe-Z3xzGNCPjP6jVGmvt9TrnXdNEx_tfqCUmpkLY7Iihnd1MooekxWB8kH8jHnLYqYZHJFLu-mEne-r8K-lDhsqjYmCCWOQ6780FZz4IdND9WYIgzFz1eV7zcYlsfdGTnpfJ_h05s_Jf9-_ni4-V3f3v36c3N9WwehTam9FAAdtyF4HvhadFxZw3loGQXhbUO5bzuwBlpBG2GkbdZShg6nW3datpqfkvOl7pTG_3vIxW3HfRrwSddQwYxQchbJRRTSmHOCzk0JZ0vPjlE3k3KvpNyMwVntXkk5gXl_l7wEE4RDEuDajgmye3LcM2pxf55P1hp0EY2jTWhKUac0c49lh9W-vLXqc_B9l_wQYj5UbbhQCB9lV4sMENtThORyQMABlg9w7RjfafsFpuSWXA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>204184657</pqid></control><display><type>article</type><title>Optimal cutting directions and rectangle orientation algorithm</title><source>RePEc</source><source>Elsevier ScienceDirect Journals</source><creator>Almeida, A.M.C. ; Martins, Ernesto Q.V. ; Rodrigues, Rosália D.</creator><creatorcontrib>Almeida, A.M.C. ; Martins, Ernesto Q.V. ; Rodrigues, Rosália D.</creatorcontrib><description>The first stage in hierarchical approaches to Floorplan Design defines topological relations between components that intend to optimize a given objective in a circuit board. These relations determine a placement that is subsequently optimized in order to minimize a cost measurement (that will probably be one between chip area or perimeter). The board optimization gives rise to multiple subproblems that need to be answered in order to obtain a good solution. Among the most relevant ones we find the problem of defining the optimal orientation of cells and the definition of the optimal cutting sequence that minimize the placement board area. We will present a generalization of an algorithm due to Stockmeyer so that it obtains a solution that not only defines the optimal cell orientation but also the slicing cuts sequence that will lead to this optimal orientation and overall area minimization.</description><identifier>ISSN: 0377-2217</identifier><identifier>EISSN: 1872-6860</identifier><identifier>DOI: 10.1016/S0377-2217(97)00085-4</identifier><identifier>CODEN: EJORDT</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Algorithms ; Applied sciences ; Compaction ; Cutting direction ; Electronic equipment and fabrication. Passive components, printed wiring boards, connectics ; Electronics ; Exact sciences and technology ; Flows in networks. Combinatorial problems ; Manufacturing ; Nondominated solution ; Operational research and scientific management ; Operational research. Management science ; Operations research ; Optimization ; Packing ; Rectangle orientation ; Studies</subject><ispartof>European journal of operational research, 1998-09, Vol.109 (3), p.660-671</ispartof><rights>1998</rights><rights>1998 INIST-CNRS</rights><rights>Copyright Elsevier Sequoia S.A. Sep 16, 1998</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c478t-a54eef39cca3c3b4f369833cd10e4a9203adfe98ed40248592b55cf101bf75d73</citedby><cites>FETCH-LOGICAL-c478t-a54eef39cca3c3b4f369833cd10e4a9203adfe98ed40248592b55cf101bf75d73</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/S0377-2217(97)00085-4$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3536,3993,27903,27904,45974</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=2346001$$DView record in Pascal Francis$$Hfree_for_read</backlink><backlink>$$Uhttp://econpapers.repec.org/article/eeeejores/v_3a109_3ay_3a1998_3ai_3a3_3ap_3a660-671.htm$$DView record in RePEc$$Hfree_for_read</backlink></links><search><creatorcontrib>Almeida, A.M.C.</creatorcontrib><creatorcontrib>Martins, Ernesto Q.V.</creatorcontrib><creatorcontrib>Rodrigues, Rosália D.</creatorcontrib><title>Optimal cutting directions and rectangle orientation algorithm</title><title>European journal of operational research</title><description>The first stage in hierarchical approaches to Floorplan Design defines topological relations between components that intend to optimize a given objective in a circuit board. These relations determine a placement that is subsequently optimized in order to minimize a cost measurement (that will probably be one between chip area or perimeter). The board optimization gives rise to multiple subproblems that need to be answered in order to obtain a good solution. Among the most relevant ones we find the problem of defining the optimal orientation of cells and the definition of the optimal cutting sequence that minimize the placement board area. We will present a generalization of an algorithm due to Stockmeyer so that it obtains a solution that not only defines the optimal cell orientation but also the slicing cuts sequence that will lead to this optimal orientation and overall area minimization.</description><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Compaction</subject><subject>Cutting direction</subject><subject>Electronic equipment and fabrication. Passive components, printed wiring boards, connectics</subject><subject>Electronics</subject><subject>Exact sciences and technology</subject><subject>Flows in networks. Combinatorial problems</subject><subject>Manufacturing</subject><subject>Nondominated solution</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Operations research</subject><subject>Optimization</subject><subject>Packing</subject><subject>Rectangle orientation</subject><subject>Studies</subject><issn>0377-2217</issn><issn>1872-6860</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1998</creationdate><recordtype>article</recordtype><sourceid>X2L</sourceid><recordid>eNqFkU1P3DAQhi0EUrfQn1ApQj2UQ1o7_r6AEOqXisQBera8zmTxKpuktheJf8-EoL1iaTwe-Z3xzGNCPjP6jVGmvt9TrnXdNEx_tfqCUmpkLY7Iihnd1MooekxWB8kH8jHnLYqYZHJFLu-mEne-r8K-lDhsqjYmCCWOQ6780FZz4IdND9WYIgzFz1eV7zcYlsfdGTnpfJ_h05s_Jf9-_ni4-V3f3v36c3N9WwehTam9FAAdtyF4HvhadFxZw3loGQXhbUO5bzuwBlpBG2GkbdZShg6nW3datpqfkvOl7pTG_3vIxW3HfRrwSddQwYxQchbJRRTSmHOCzk0JZ0vPjlE3k3KvpNyMwVntXkk5gXl_l7wEE4RDEuDajgmye3LcM2pxf55P1hp0EY2jTWhKUac0c49lh9W-vLXqc_B9l_wQYj5UbbhQCB9lV4sMENtThORyQMABlg9w7RjfafsFpuSWXA</recordid><startdate>19980916</startdate><enddate>19980916</enddate><creator>Almeida, A.M.C.</creator><creator>Martins, Ernesto Q.V.</creator><creator>Rodrigues, Rosália D.</creator><general>Elsevier B.V</general><general>Elsevier</general><general>Elsevier Sequoia S.A</general><scope>IQODW</scope><scope>DKI</scope><scope>X2L</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19980916</creationdate><title>Optimal cutting directions and rectangle orientation algorithm</title><author>Almeida, A.M.C. ; Martins, Ernesto Q.V. ; Rodrigues, Rosália D.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c478t-a54eef39cca3c3b4f369833cd10e4a9203adfe98ed40248592b55cf101bf75d73</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1998</creationdate><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Compaction</topic><topic>Cutting direction</topic><topic>Electronic equipment and fabrication. Passive components, printed wiring boards, connectics</topic><topic>Electronics</topic><topic>Exact sciences and technology</topic><topic>Flows in networks. Combinatorial problems</topic><topic>Manufacturing</topic><topic>Nondominated solution</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Operations research</topic><topic>Optimization</topic><topic>Packing</topic><topic>Rectangle orientation</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Almeida, A.M.C.</creatorcontrib><creatorcontrib>Martins, Ernesto Q.V.</creatorcontrib><creatorcontrib>Rodrigues, Rosália D.</creatorcontrib><collection>Pascal-Francis</collection><collection>RePEc IDEAS</collection><collection>RePEc</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>European journal of operational research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Almeida, A.M.C.</au><au>Martins, Ernesto Q.V.</au><au>Rodrigues, Rosália D.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Optimal cutting directions and rectangle orientation algorithm</atitle><jtitle>European journal of operational research</jtitle><date>1998-09-16</date><risdate>1998</risdate><volume>109</volume><issue>3</issue><spage>660</spage><epage>671</epage><pages>660-671</pages><issn>0377-2217</issn><eissn>1872-6860</eissn><coden>EJORDT</coden><abstract>The first stage in hierarchical approaches to Floorplan Design defines topological relations between components that intend to optimize a given objective in a circuit board. These relations determine a placement that is subsequently optimized in order to minimize a cost measurement (that will probably be one between chip area or perimeter). The board optimization gives rise to multiple subproblems that need to be answered in order to obtain a good solution. Among the most relevant ones we find the problem of defining the optimal orientation of cells and the definition of the optimal cutting sequence that minimize the placement board area. We will present a generalization of an algorithm due to Stockmeyer so that it obtains a solution that not only defines the optimal cell orientation but also the slicing cuts sequence that will lead to this optimal orientation and overall area minimization.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/S0377-2217(97)00085-4</doi><tpages>12</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0377-2217 |
| ispartof | European journal of operational research, 1998-09, Vol.109 (3), p.660-671 |
| issn | 0377-2217 1872-6860 |
| language | eng |
| recordid | cdi_proquest_journals_204184657 |
| source | RePEc; Elsevier ScienceDirect Journals |
| subjects | Algorithms Applied sciences Compaction Cutting direction Electronic equipment and fabrication. Passive components, printed wiring boards, connectics Electronics Exact sciences and technology Flows in networks. Combinatorial problems Manufacturing Nondominated solution Operational research and scientific management Operational research. Management science Operations research Optimization Packing Rectangle orientation Studies |
| title | Optimal cutting directions and rectangle orientation algorithm |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-23T03%3A12%3A42IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Optimal%20cutting%20directions%20and%20rectangle%20orientation%20algorithm&rft.jtitle=European%20journal%20of%20operational%20research&rft.au=Almeida,%20A.M.C.&rft.date=1998-09-16&rft.volume=109&rft.issue=3&rft.spage=660&rft.epage=671&rft.pages=660-671&rft.issn=0377-2217&rft.eissn=1872-6860&rft.coden=EJORDT&rft_id=info:doi/10.1016/S0377-2217(97)00085-4&rft_dat=%3Cproquest_cross%3E44053903%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=204184657&rft_id=info:pmid/&rft_els_id=S0377221797000854&rfr_iscdi=true |