ENG YAQIN SHAHARLARNI ANIQLASHDA GEOMETRIK ALGORITMLARNING AHAMIYATI
##semicolon##
Geometrik algoritmlar, Voronoy diagrammasi, eng yaqin shahar, Evklid masofasi, masofani hisoblash.##common.commaListSeparator## Геометрические алгоритмы, диаграмма Вороного, ближайший город, евклидовое расстояние, расчет расстояния.##common.commaListSeparator## Geometric algorithms, Voronoi diagram, nearest city, Euclidean distance, distance calculation.Abstrak
Ushbu maqolada geometrik algoritmlarning "eng yaqin shaharni topish" masalasidagi qo‘llanilishi ko‘rib chiqilgan. Masala yechimida Voronoy diagrammalari va Evklid masofasidan foydalanilgan. Algoritm har bir shahar uchun markaziy nuqta bilan masofani hisoblaydi va eng yaqin shaharni aniqlaydi.
В данной статье рассмотрено применение геометрических алгоритмов к задаче «нахождения ближайшего города». Для решения использованы диаграммы Вороного и евклидово расстояние. Алгоритм вычисляет расстояние от каждой точки до центра города, определяет ближайший.
This article explores the application of geometric algorithms to the "nearest city determination" problem. The solution employs Voronoi diagrams and Euclidean distance. The algorithm calculates the distance from each point to the city center and identifies the nearest one.
##submission.citations##
FOYDALANILGAN ADABIYOTLAR RO'YXATI
1. Knuth, D. E. (1973). *The Art of Computer Programming, Volume 1: Fundamental Algorithms*. Addison-Wesley.
2. Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2009). *Introduction to Algorithms* (3rd ed.). MIT Press.
3. Sedgewick, R., & Wayne, K. (2011). *Algorithms* (4th ed.). Addison-Wesley.
4. Azizov, M., & Saidov, S. (2017). *Geometrik algoritmlar va ularning amaliyotdagi qo‘llanilishi.* Tashkent State University of Economics.
5. Turing, A. M. (1936). *On Computable Numbers, with an Application to the Entscheidungsproblem*. Proceedings of the London Mathematical Society, 2(42), 230-265.
6. Shakhnoza, A., & Abdurahmonov, S. (2020). *Geometric Algorithms and Their Applications*. Science Journal of Applied Mathematics and Statistics, 8(2), 104-11
7. Uysal, S. (2019). Fraktal geometri ve algoritma ilişkisinde jeneratif sanat (Master's thesis, Güzel Sanatlar Enstitüsü).
8. Lubis, A. P. (2024). Analisis Kemampuan berpikir komputasi siswa SMA menggunakan software Geogebra materi Transformasi Geometri. Journal of International Multidisciplinary Research, 2(5), 24-31.
9. Raxmonjonovich, F. S. (2024). C# VA MASHINA TILI. Ta'lim innovatsiyasi va integratsiyasi, 12(1), 59-62.
10. Farmonov, S., & Usmonaliyev, U. (2024). O'ZBEKISTON RESPUBLIKASI IT SOHASINING RIVOJLANISH ISTIQBOLLARI. Бюллетень педагогов нового Узбекистана, 2(1), 59-62.
11. Farmonov, S. R., & qizi Xomidova, M. A. (2024). C# VA JAVA DASTURLASH TILLARIDA FAYLLAR BILAN ISHLASHNING TURLI USULLARINING SAMARADORLIGI HAQIDA. Zamonaviy fan va ta'lim yangiliklari xalqaro ilmiy jurnal, 1(9), 45-51.
12. Wikipedia – Geometric algorithms, Voronoi diagram. (https://en.wikipedia.org/wiki/Geometric_algorithms, https://en.wikipedia.org/wiki/Voronoi_diagram)
13. Geeks for Geeks – Algorithms for finding nearest points and Voronoi diagram. (https://www.geeksforgeeks.org) Stack Overflow – Algorithm discussions and implementation tips. (https://stackoverflow.com)
