КОНФЕРЕНЦІЇ ВНТУ електронні наукові видання, 
Молодь в науці: дослідження, проблеми, перспективи (МН-2026)

Розмір шрифта: 
APPLICATION OF CELLULAR AUTOMATA FOR PROCEDURAL TEXTURE GENERATION
Ростислав Олегович Савелко, Олександр Никифорович Романюк

Остання редакція: 2026-06-07

Анотація


The paper examines the application of cellular automata (CA) for procedural texture generation in computer graphics. The theoretical foundations of cellular automata are described, including state transition rules and their classification. Methods of using one-dimensional and two-dimensional cellular automata, particularly Conway’s Game of Life, for synthesising natural-looking textures such as stone, wood, water, and vegetation are analysed. The advantages of the procedural approach – scalability, low memory requirements, and deterministic generation – are discussed. The fundamental equation of a cellular automaton is presented, and practical implementation aspects in real-time rendering systems are considered.

Ключові слова


cellular automata; procedural textures; computer graphics; texture generation; transition rules; image synthesis; Game of Life.

Посилання


1. Lagae A., Lefebvre S., Cook R., DeRose T., Drettakis G., Ebert D., Lewis J.-P., Perlin K., Zwicker M. A Survey of Procedural Noise Functions. Computer Graphics Forum. 2010. Vol. 29, No. 8. P. 2579–2600.

2. Wolfram S. A New Kind of Science. Wolfram Media, 2002. 1197 p.

3. Ilachinski A. Cellular Automata: A Discrete Universe. World Scientific, 2001. 808 p.

4. Johnson L., Yannakakis G. N., Togelius J. Cellular Automata for Real-time Generation of Infinite Cave Levels. Proceedings of the 2010 Workshop on Procedural Content Generation in Games. 2010. P. 1–4.


Повний текст: PDF