{"id":{"repo_id":"vilnius","oai_identifier":"oai:vu.lt:elaba:308338280"},"canonical_url":"https://search.ndltd.org/etd/vilnius/oai:vu.lt:elaba:308338280","repository":{"repo_id":"vilnius","name":"Vilnius University","base_url":"https://epublications.vu.lt/oai"},"display":{"title":"Skysčių simuliacijos kompiuteriniuose žaidimuose realiuoju laiku naudojant ląstelinius automatus /","abstract":"This paper analyzes cellular automaton-based liquid simulation and its application for real-time voxel-based video games. Implemented three simulation types: sequential CPU execution, parallel CPU execution using the C# Job System and Burst Compiler, and parallel GPU execution using compute shaders. Each implementation is tested in three different environments: the filled in world, waterfall and falling sphere, by measuring frame execution time. It is found that parallel CPU implementation is approximately twice as fast as sequential CPU in environments with always growing active voxel count. However, in falling sphere environment the difference between implementations is negligible due to the large voxel count in the environment. GPU implementation achieved lowest frame times in all environments. Among the optimisations studied, iterating only over active voxels rather than the entire world array yielded the most significant performance improvement.","abstract_html":"This paper analyzes cellular automaton-based liquid simulation and its application for real-time voxel-based video games. Implemented three simulation types: sequential CPU execution, parallel CPU execution using the C# Job System and Burst Compiler, and parallel GPU execution using compute shaders. Each implementation is tested in three different environments: the filled in world, waterfall and falling sphere, by measuring frame execution time. It is found that parallel CPU implementation is approximately twice as fast as sequential CPU in environments with always growing active voxel count. However, in falling sphere environment the difference between implementations is negligible due to the large voxel count in the environment. GPU implementation achieved lowest frame times in all environments. Among the optimisations studied, iterating only over active voxels rather than the entire world array yielded the most significant performance improvement.","abstract_has_math":false,"creators":["Paškonis, Vilius,"],"institution":"Institutional Repository of Vilnius University","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2026,"date_issued":"2026","date_published":"2026","updated_at":"2026-11-19T10:12:59Z","subjects":[],"languages":["lit"],"rights":["info:eu-repo/semantics/openAccess"],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://repository.vu.lt/VU:ELABAETD308338280&prefLang=en_US","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://repository.vu.lt/VU:ELABAETD308338280&prefLang=en_US","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":"open","embargo_until":null,"access_note":null},"source_record":{"url":"https://epublications.vu.lt/oai?verb=GetRecord&metadataPrefix=oai_dc&identifier=oai%3Avu.lt%3Aelaba%3A308338280","prefix":"oai_dc"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Paškonis, Vilius,"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2026"]},{"key":"dc:publisher","label":"Institution","values":["Institutional Repository of Vilnius University"]},{"key":"dc:relation","label":"Dc Relation","values":["https://epublications.vu.lt/object/elaba:308338280/308338280.pdf"]},{"key":"dc:type","label":"Dc Type","values":["info:eu-repo/semantics/bachelorThesis"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["lit"]},{"key":"dc:rights","label":"Dc Rights","values":["info:eu-repo/semantics/openAccess"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://repository.vu.lt/VU:ELABAETD308338280&prefLang=en_US"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["This paper analyzes cellular automaton-based liquid simulation and its application for real-time voxel-based video games. Implemented three simulation types: sequential CPU execution, parallel CPU execution using the C# Job System and Burst Compiler, and parallel GPU execution using compute shaders. Each implementation is tested in three different environments: the filled in world, waterfall and falling sphere, by measuring frame execution time. It is found that parallel CPU implementation is approximately twice as fast as sequential CPU in environments with always growing active voxel count. However, in falling sphere environment the difference between implementations is negligible due to the large voxel count in the environment. GPU implementation achieved lowest frame times in all environments. Among the optimisations studied, iterating only over active voxels rather than the entire world array yielded the most significant performance improvement."]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Skysčių simuliacijos kompiuteriniuose žaidimuose realiuoju laiku naudojant ląstelinius automatus /","Real-time liquid simulation in video games using cellular automata."]}]}],"canonical_facts":{"dc:creator":["Paškonis, Vilius,"],"dc:date":["2026"],"dc:description":["This paper analyzes cellular automaton-based liquid simulation and its application for real-time voxel-based video games. Implemented three simulation types: sequential CPU execution, parallel CPU execution using the C# Job System and Burst Compiler, and parallel GPU execution using compute shaders. Each implementation is tested in three different environments: the filled in world, waterfall and falling sphere, by measuring frame execution time. It is found that parallel CPU implementation is approximately twice as fast as sequential CPU in environments with always growing active voxel count. However, in falling sphere environment the difference between implementations is negligible due to the large voxel count in the environment. GPU implementation achieved lowest frame times in all environments. Among the optimisations studied, iterating only over active voxels rather than the entire world array yielded the most significant performance improvement."],"dc:format":["application/pdf"],"dc:identifier":["https://repository.vu.lt/VU:ELABAETD308338280&prefLang=en_US"],"dc:language":["lit"],"dc:publisher":["Institutional Repository of Vilnius University"],"dc:relation":["https://epublications.vu.lt/object/elaba:308338280/308338280.pdf"],"dc:rights":["info:eu-repo/semantics/openAccess"],"dc:title":["Skysčių simuliacijos kompiuteriniuose žaidimuose realiuoju laiku naudojant ląstelinius automatus /","Real-time liquid simulation in video games using cellular automata."],"dc:type":["info:eu-repo/semantics/bachelorThesis"]},"updated_at":"2026-11-19T10:12:59Z"}