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...
| 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 |