Показати скорочену інформацію

dc.contributor.authorBobko, O.en
dc.contributor.authorRomanyuk, O.en
dc.contributor.authorБобко, О. Л.en
dc.contributor.authorРоманюк, О. Н.en
dc.date.accessioned2026-03-05T11:53:51Z
dc.date.available2026-03-05T11:53:51Z
dc.date.issued2026en
dc.identifier.citationBobko O., Romanyuk O. Analysis of the computational complexity of rendering methods // Proceedings of the 6th International Scientific and Practical Conference «Scientific Exploration: Bridging Theory and Practice», Berlin, Germany, February 16-18, 2026, Berlin : European Open Science Space, 2026. Iss. 75. Р. 71-76.en
dc.identifier.isbn979-8-89704-960-8en
dc.identifier.urihttps://ir.lib.vntu.edu.ua//handle/123456789/50744
dc.description.abstractis paper analyzes the main rendering methods in computer graphics with an emphasis on their computational complexity and application areas. Classical approaches to surface shading are considered. For each method, the asymptotic time complexity is evaluated both for the entire scene and for individual objects (using the Utah teapot model as an example). The prevalence of these methods in modern practice including the game industry, offline visualization, and scientific and medical graphics is also analyzed.uk_UA
dc.language.isoen_USen_US
dc.publisherEuropean Open Science Spaceen
dc.relation.ispartofProceedings of the 6th International Scientific and Practical Conference «Scientific Exploration: Bridging Theory and Practice», Berlin, Germany, February 16-18, 2026. Iss. 75 : 71-76.en
dc.subjectrasterizationen
dc.subjectrenderingen
dc.subjectcomputational complexityen
dc.subjectgraphics algorithmsen
dc.subjectmethod prevalenceen
dc.titleAnalysis of the computational complexity of rendering methodsen
dc.typeThesis
dc.identifier.udc004.92en
dc.identifier.doihttps://doi.org/10.70286/EOSS-16.02.2026en
dc.identifier.orcidhttps://orcid.org/en


Файли в цьому документі

Thumbnail

Даний документ включений в наступну(і) колекцію(ї)

Показати скорочену інформацію