A Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | fas |
| Published: |
Kharazmi University
2018-12-01
|
| Series: | پژوهشهای ریاضی |
| Subjects: | |
| Online Access: | http://mmr.khu.ac.ir/article-1-2680-en.html |