The Concept of Modeling Packing and Covering Problems Using Modern Computational Geometry Software
A class of geometric packing and covering problems is considered. A new concept of their mathematical modeling using a special class of functions is proposed. To solve the problems, special computational geometry software libraries are used. They do not require an analytical form of the functions th...
Gespeichert in:
| Veröffentlicht in: | Cybernetics and systems analysis 2023, Vol.59 (1), p.108-119 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 119 |
|---|---|
| container_issue | 1 |
| container_start_page | 108 |
| container_title | Cybernetics and systems analysis |
| container_volume | 59 |
| creator | Yakovlev, S. V. |
| description | A class of geometric packing and covering problems is considered. A new concept of their mathematical modeling using a special class of functions is proposed. To solve the problems, special computational geometry software libraries are used. They do not require an analytical form of the functions that describe the packing and covering conditions but allow their verification. The reduction of the computing cost is substantiated, which expands the possibilities of the efficient application of local and global optimization methods. The results of solving the test problems of the maximum coverage of a rectangular area with a set of ellipses of given sizes and the problem of packing ellipses in a rectangle of minimum area are provided. |
| doi_str_mv | 10.1007/s10559-023-00547-5 |
| format | Article |
| fullrecord | <record><control><sourceid>gale_proqu</sourceid><recordid>TN_cdi_proquest_journals_2787905091</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><galeid>A743413760</galeid><sourcerecordid>A743413760</sourcerecordid><originalsourceid>FETCH-LOGICAL-c392t-a20e5b5624e8e935e4079816f36b30c3457c6e2d8f716090ed22040b61c401203</originalsourceid><addsrcrecordid>eNp9kctKxTAQhosoeH0BVwVXLqqTpEnapRy8gaJ4WYc0nR6rbVOTHC9vb2oFcSOzmMnM9w9D_iTZJ3BEAOSxJ8B5mQFlGQDPZcbXki3CJcsKxuR6rEFABqwUm8m2988AwEAWW0n18ITpwg4Gx5DaJr22NXbtsExvtXmZsh7qOH9D9910tuqw9-mjn54T7IY47sdV0KG1g-7Sc7Q9BveZ3tsmvGuHu8lGozuPez95J3k8O31YXGRXN-eXi5OrzLCShkxTQF5xQXMssGQcc5BlQUTDRMXAsJxLI5DWRSOJgBKwphRyqAQxORAKbCc5mPeOzr6u0Af1bFcunuQVlYUsgUNJInU0U0vdoWqHxganTYwa-9bYAZs29k9kznLCpJjWHv4RRCbgR1jqlffq8v7uL0tn1jjrvcNGja7ttftUBNRklJqNUtEo9W2U4lHEZpEfp09G93v3P6ovnq6TbA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2787905091</pqid></control><display><type>article</type><title>The Concept of Modeling Packing and Covering Problems Using Modern Computational Geometry Software</title><source>SpringerNature Journals</source><creator>Yakovlev, S. V.</creator><creatorcontrib>Yakovlev, S. V.</creatorcontrib><description>A class of geometric packing and covering problems is considered. A new concept of their mathematical modeling using a special class of functions is proposed. To solve the problems, special computational geometry software libraries are used. They do not require an analytical form of the functions that describe the packing and covering conditions but allow their verification. The reduction of the computing cost is substantiated, which expands the possibilities of the efficient application of local and global optimization methods. The results of solving the test problems of the maximum coverage of a rectangular area with a set of ellipses of given sizes and the problem of packing ellipses in a rectangle of minimum area are provided.</description><identifier>ISSN: 1060-0396</identifier><identifier>EISSN: 1573-8337</identifier><identifier>DOI: 10.1007/s10559-023-00547-5</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Artificial Intelligence ; Computational geometry ; Computing costs ; Control ; Ellipses ; Global optimization ; Mathematics ; Mathematics and Statistics ; Processor Architectures ; Rectangles ; Software ; Software Engineering/Programming and Operating Systems ; Systems Theory</subject><ispartof>Cybernetics and systems analysis, 2023, Vol.59 (1), p.108-119</ispartof><rights>Springer Science+Business Media, LLC, part of Springer Nature 2023. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.</rights><rights>COPYRIGHT 2023 Springer</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c392t-a20e5b5624e8e935e4079816f36b30c3457c6e2d8f716090ed22040b61c401203</citedby><cites>FETCH-LOGICAL-c392t-a20e5b5624e8e935e4079816f36b30c3457c6e2d8f716090ed22040b61c401203</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s10559-023-00547-5$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s10559-023-00547-5$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,41488,42557,51319</link.rule.ids></links><search><creatorcontrib>Yakovlev, S. V.</creatorcontrib><title>The Concept of Modeling Packing and Covering Problems Using Modern Computational Geometry Software</title><title>Cybernetics and systems analysis</title><addtitle>Cybern Syst Anal</addtitle><description>A class of geometric packing and covering problems is considered. A new concept of their mathematical modeling using a special class of functions is proposed. To solve the problems, special computational geometry software libraries are used. They do not require an analytical form of the functions that describe the packing and covering conditions but allow their verification. The reduction of the computing cost is substantiated, which expands the possibilities of the efficient application of local and global optimization methods. The results of solving the test problems of the maximum coverage of a rectangular area with a set of ellipses of given sizes and the problem of packing ellipses in a rectangle of minimum area are provided.</description><subject>Artificial Intelligence</subject><subject>Computational geometry</subject><subject>Computing costs</subject><subject>Control</subject><subject>Ellipses</subject><subject>Global optimization</subject><subject>Mathematics</subject><subject>Mathematics and Statistics</subject><subject>Processor Architectures</subject><subject>Rectangles</subject><subject>Software</subject><subject>Software Engineering/Programming and Operating Systems</subject><subject>Systems Theory</subject><issn>1060-0396</issn><issn>1573-8337</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><recordid>eNp9kctKxTAQhosoeH0BVwVXLqqTpEnapRy8gaJ4WYc0nR6rbVOTHC9vb2oFcSOzmMnM9w9D_iTZJ3BEAOSxJ8B5mQFlGQDPZcbXki3CJcsKxuR6rEFABqwUm8m2988AwEAWW0n18ITpwg4Gx5DaJr22NXbtsExvtXmZsh7qOH9D9910tuqw9-mjn54T7IY47sdV0KG1g-7Sc7Q9BveZ3tsmvGuHu8lGozuPez95J3k8O31YXGRXN-eXi5OrzLCShkxTQF5xQXMssGQcc5BlQUTDRMXAsJxLI5DWRSOJgBKwphRyqAQxORAKbCc5mPeOzr6u0Af1bFcunuQVlYUsgUNJInU0U0vdoWqHxganTYwa-9bYAZs29k9kznLCpJjWHv4RRCbgR1jqlffq8v7uL0tn1jjrvcNGja7ttftUBNRklJqNUtEo9W2U4lHEZpEfp09G93v3P6ovnq6TbA</recordid><startdate>2023</startdate><enddate>2023</enddate><creator>Yakovlev, S. V.</creator><general>Springer US</general><general>Springer</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>ISR</scope><scope>JQ2</scope></search><sort><creationdate>2023</creationdate><title>The Concept of Modeling Packing and Covering Problems Using Modern Computational Geometry Software</title><author>Yakovlev, S. V.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c392t-a20e5b5624e8e935e4079816f36b30c3457c6e2d8f716090ed22040b61c401203</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Artificial Intelligence</topic><topic>Computational geometry</topic><topic>Computing costs</topic><topic>Control</topic><topic>Ellipses</topic><topic>Global optimization</topic><topic>Mathematics</topic><topic>Mathematics and Statistics</topic><topic>Processor Architectures</topic><topic>Rectangles</topic><topic>Software</topic><topic>Software Engineering/Programming and Operating Systems</topic><topic>Systems Theory</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Yakovlev, S. V.</creatorcontrib><collection>CrossRef</collection><collection>Gale In Context: Science</collection><collection>ProQuest Computer Science Collection</collection><jtitle>Cybernetics and systems analysis</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Yakovlev, S. V.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>The Concept of Modeling Packing and Covering Problems Using Modern Computational Geometry Software</atitle><jtitle>Cybernetics and systems analysis</jtitle><stitle>Cybern Syst Anal</stitle><date>2023</date><risdate>2023</risdate><volume>59</volume><issue>1</issue><spage>108</spage><epage>119</epage><pages>108-119</pages><issn>1060-0396</issn><eissn>1573-8337</eissn><abstract>A class of geometric packing and covering problems is considered. A new concept of their mathematical modeling using a special class of functions is proposed. To solve the problems, special computational geometry software libraries are used. They do not require an analytical form of the functions that describe the packing and covering conditions but allow their verification. The reduction of the computing cost is substantiated, which expands the possibilities of the efficient application of local and global optimization methods. The results of solving the test problems of the maximum coverage of a rectangular area with a set of ellipses of given sizes and the problem of packing ellipses in a rectangle of minimum area are provided.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s10559-023-00547-5</doi><tpages>12</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1060-0396 |
| ispartof | Cybernetics and systems analysis, 2023, Vol.59 (1), p.108-119 |
| issn | 1060-0396 1573-8337 |
| language | eng |
| recordid | cdi_proquest_journals_2787905091 |
| source | SpringerNature Journals |
| subjects | Artificial Intelligence Computational geometry Computing costs Control Ellipses Global optimization Mathematics Mathematics and Statistics Processor Architectures Rectangles Software Software Engineering/Programming and Operating Systems Systems Theory |
| title | The Concept of Modeling Packing and Covering Problems Using Modern Computational Geometry Software |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-22T08%3A55%3A50IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-gale_proqu&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=The%20Concept%20of%20Modeling%20Packing%20and%20Covering%20Problems%20Using%20Modern%20Computational%20Geometry%20Software&rft.jtitle=Cybernetics%20and%20systems%20analysis&rft.au=Yakovlev,%20S.%20V.&rft.date=2023&rft.volume=59&rft.issue=1&rft.spage=108&rft.epage=119&rft.pages=108-119&rft.issn=1060-0396&rft.eissn=1573-8337&rft_id=info:doi/10.1007/s10559-023-00547-5&rft_dat=%3Cgale_proqu%3EA743413760%3C/gale_proqu%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2787905091&rft_id=info:pmid/&rft_galeid=A743413760&rfr_iscdi=true |