Izliektu režģa daudzstūru laukuma minimizācijas problēma
Loading...
Date
Authors
Advisor
Journal Title
Journal ISSN
Volume Title
Publisher
Latvijas Universitāte
Language
N/A
Abstract
Darbā aplūkota problēma par izliektu režģa n-stūru minimālā laukuma atrašanu. Pierādīta teorēma par vienāda laukuma n-stūru klasi un apskatītas tās sekas. Dots izliektu režģa n-stūru ar minimālo laukumu atrašanas algoritms, ka arī tā realizācija ar programmēšanas līdzekļiem.
This paper deals with the problem of determining convex lattice polygon with minimum area. The theorem about the set of polygons with equal area has been proved and the consequences of this theorem have been considered as well. The algorithm for determining lattice convex polygon with minimum area is considered. Algorithm realization using programming software is considered as well.
This paper deals with the problem of determining convex lattice polygon with minimum area. The theorem about the set of polygons with equal area has been proved and the consequences of this theorem have been considered as well. The algorithm for determining lattice convex polygon with minimum area is considered. Algorithm realization using programming software is considered as well.