Elimination the redundancy in coverage of a topological object with rectangles
The approximate method of finding the shortest path of topological object covering by rectangles of type polygon given in discrete form by many nodal points is described. The discrete form of the description of the polygon eliminates topological design problem connected with the presence of problems...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
Educational institution «Belarusian State University of Informatics and Radioelectronics»
2019-06-01
|
| Series: | Doklady Belorusskogo gosudarstvennogo universiteta informatiki i radioèlektroniki |
| Subjects: | |
| Online Access: | https://doklady.bsuir.by/jour/article/view/927 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849243445225324544 |
|---|---|
| author | A. A. Butov |
| author_facet | A. A. Butov |
| author_sort | A. A. Butov |
| collection | DOAJ |
| description | The approximate method of finding the shortest path of topological object covering by rectangles of type polygon given in discrete form by many nodal points is described. The discrete form of the description of the polygon eliminates topological design problem connected with the presence of problems of computational accuracy. The article refers to the next phase of the research related to the overall task of developing a software system for the preparation of topology information for microphotograph image generators. |
| format | Article |
| id | doaj-art-19e7a17dc6964839bc0ac0fdc39e91f7 |
| institution | Kabale University |
| issn | 1729-7648 |
| language | Russian |
| publishDate | 2019-06-01 |
| publisher | Educational institution «Belarusian State University of Informatics and Radioelectronics» |
| record_format | Article |
| series | Doklady Belorusskogo gosudarstvennogo universiteta informatiki i radioèlektroniki |
| spelling | doaj-art-19e7a17dc6964839bc0ac0fdc39e91f72025-08-20T03:59:27ZrusEducational institution «Belarusian State University of Informatics and Radioelectronics»Doklady Belorusskogo gosudarstvennogo universiteta informatiki i radioèlektroniki1729-76482019-06-01081320926Elimination the redundancy in coverage of a topological object with rectanglesA. A. Butov0Belarusian state university of informatics and radioelectronicsThe approximate method of finding the shortest path of topological object covering by rectangles of type polygon given in discrete form by many nodal points is described. The discrete form of the description of the polygon eliminates topological design problem connected with the presence of problems of computational accuracy. The article refers to the next phase of the research related to the overall task of developing a software system for the preparation of topology information for microphotograph image generators.https://doklady.bsuir.by/jour/article/view/927vlsi topologydiscrete optimizationshortest coverage |
| spellingShingle | A. A. Butov Elimination the redundancy in coverage of a topological object with rectangles Doklady Belorusskogo gosudarstvennogo universiteta informatiki i radioèlektroniki vlsi topology discrete optimization shortest coverage |
| title | Elimination the redundancy in coverage of a topological object with rectangles |
| title_full | Elimination the redundancy in coverage of a topological object with rectangles |
| title_fullStr | Elimination the redundancy in coverage of a topological object with rectangles |
| title_full_unstemmed | Elimination the redundancy in coverage of a topological object with rectangles |
| title_short | Elimination the redundancy in coverage of a topological object with rectangles |
| title_sort | elimination the redundancy in coverage of a topological object with rectangles |
| topic | vlsi topology discrete optimization shortest coverage |
| url | https://doklady.bsuir.by/jour/article/view/927 |
| work_keys_str_mv | AT aabutov eliminationtheredundancyincoverageofatopologicalobjectwithrectangles |