THE ANALYSIS OF THE COVERAGE IN COMMUNICATION SYSTEMS BASED ON GEOMETRICAL ALGORITHMS

This paper discusses the issues related to improvement of radio coverage in the communication systems. It is proposed to reduce this problem to geometric to analyze whether a given point to the polygon, where the polygon represents the coverage area of certain base station. We consider several algorithms. In the method of ray tracing produced by a ray of given points in certain directions and counting the number of times the beam is the intersection of edges of the polygon. Also considered trigonometric algorithm when the points hold the rays for all the vertices of the polygons. The analysis rpm which is oriented boundary of the polygon around a point

1. Kanavin S. V. Perspektivy primeneniya sistem mobil'nogo shirokopolosnogo dostupa v setyakh podvizhnoy radiosvyazi na osnove standartov mobile WIMAX i LTE / S. V. Kanavin, A. S. Luk'yanov // Vestnik Voronezhskogo instituta vysokikh tekhnologiy. 2016. № 16. S. 79- 82.

2. Baranov A.V. Problemy funktsionirovaniya mesh-setey / A.V.Baranov // Vestnik Voronezhskogo instituta vysokikh tekhnologiy. 2012. № 9. S. 49-50.

3. Miloshenko O.V. Metody otsenki kharakteristik rasprostraneniya radiovoln v sistemakh podvizhnoy radiosvyazi / O.V.Miloshenko // Vestnik Voronezhskogo instituta vysokikh tekhnologiy. 2012. № 9. S. 60-62

4. Mishin Ya.A. O sistemakh avtomatizirovannogo proektirovaniya v besprovodnykh setyakh / Ya.A.Mishin // Vestnik Voronezhskogo instituta vysokikh tekhnologiy. 2013. № 10. S. 153-156.

5. Golovinov S.O. Problemy upravleniya sistemami mobil'noy svyazi / S.O.Golovinov, A.A.Khromykh // Vestnik Voronezhskogo instituta vysokikh tekhnologiy. 2012. № 9. S. 13-14.

6. Erasov S.V. Optimizatsionnye protsessy v elektrodinamicheskikh zadachakh / S.V.Erasov // Vestnik Voronezhskogo instituta vysokikh tekhnologiy. 2013. № 10. S. 20-26.

7. Maksimova A. A. Metody issledovaniya kharakteristik rasseyaniya elektromagnitnykh voln ob"ektami / A. A. Maksimova, A. G. Yurochkin //Vestnik Voronezhskogo instituta vysokikh tekhnologiy. 2016. № 16. S. 53- 56.

8. Laslo M. Vychislitel'naya geometriya i komp'yuternaya grafika na C++ / M.Laslo // BINOM, 1997. - 304 s.

9. Robert Cimikowski Algorithms for the fixed linear crossing number problem / Cimikowski Robert // Discrete Applied Mathematics, Volume 122, Issues 1-3, 15 October 2002, Pp. 93-115

10. Shikin E.V. Nachala komp'yuternoy grafiki. / E.V.Shikin //M.: DIALOG - MIFI, 2000. - 374 s.

11. Skvortsov A.V. Algoritmy postroeniya i analiza triangulyatsii. / A.V.Skvortsov // T.: Izdatel'stvo Tomskogo universiteta, 2006. - 167 s.

12. . https://root.cern.ch/TaligentDocs/TaligentOnline/DocumentRoot/1.0/Docs/bo oks/GS/GS_61.html.

13. http://compgraph.tpu.ru/Oglavlenie.htm

14. Appel A. The Notion of Quantitative invisibility and the Machine Rendering of Solids / A.Appel // Proceedings ACM National Conference (1967), pp. 387-393.

15. Robert F. Sproull Sutherland A clipping divider / Robert F. Sproull, E.Ivan // AFIPS Joint Computer Conferences : Proceedings of the December 9-11, 1968, fall joint computer conference. - New York: ACM, 1968. - Т. I. - С. 765-775.

16. http://cs1.bradley.edu/public/jcm/cs535CyrusBeck.html

17. http://www.rps2.ru/product.php.