Infopaket

Computational geometry and computer graphics

ОК.34

Обов’язкова дисципліна для ОП

First

2021/2022

6 Semester

4

1. Know the basic algorithmic tools (data structures) and constructions (Voronoi diagram, Delaunay triangulation), algorithmic strategies (divide and conquer), as well as the methodology of analysis and solving problems of computational geometry. 2. Be able to solve problems and analyze the obtained algorithms with the help of computational geometry tools and apply the acquired knowledge in practice.

1. Know: basics of the disciplines "Programming", "Algorithm Theory", "Complex Theory", "Linear Algebra and Analytical Geometry", "Mathematical Analysis". 2. Be able to: analyze tasks and determine estimates of complexity; apply the concepts, structures and algorithms of computational geometry to solve a wide range of problems in applied mathematics. 3. Possess computational geometry as a universal technology for solving scientific and applied problems; learning skills.

The discipline "Computational Geometry and Computer Graphics" is part of the educational-professional training program for educational qualification level " bachelor" of knowledge 12 "Information Technology" specialty 122 " Computer Science", educational program " Computer Science». It is a basic discipline of higher education institutions specializing in information technology, as well as an effective tool for solving scientific and engineering problems. The purpose and objectives of the discipline is to get acquainted with one of the main scientific areas in the field of computer technology "Computational Geometry" and master the technology of solving a wide range of problems of science and technology (including computer graphics) using methods, approaches, and computational geometry algorithms.

1. Preparata F., Sheymos M. Vychislitel'naya geometriya: Vvedeniye. G.: Mir, 1989. – 478 s. 2. Akho KH., Khopkroft Dzh., Ul'man Dzh. Postroyeniye i analiz vychislitel'nykh algoritmov. M.: Mir, 1979. – 536. 3. Rodzhers D. Algoritmicheskiye osnovy mashinnoy grafiki. M.:Mir, 1989.- 504 s. 4. V.M. Tereshchenko, Í.V. Kravchenko, A. V. Anísímov. Osnovní algoritmi obchislyuval'noí̈ geometríí̈, Kií̈v, 2002r, 81 s. 5. Maykl Laslo. Vychislitel'naya geometriya i komp'yuternaya grafika na S++. M.:Binom, 1997.-301 s. 6. Goodman J.E., O'Rourke J. Handbook of Discrete and Computational Geometry. - N.Y.: Chapman and Hall/CRC Press, 2004. – 1497 p. 7. Mark de Berg, Otfried Cheong, Marc van Kreveld, Mark Overmars. Computational Geometry:Algorithms and Applications.Berlin Heidelberg: Springer-Verlag, 2008. – 386 p.

Lecture, laboratory work, individual work.

Test work, defense of laboratory work, exam.

Ukrainian language