Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Engineering
Textured Hierarchical Precomputed Radiance Transfer, Harrison Lee Mckenzie Chapter
Textured Hierarchical Precomputed Radiance Transfer, Harrison Lee Mckenzie Chapter
Master's Theses
Computing complex lighting simulations such as global illumination is a computationally intensive task. Various real time solutions exist to approximate aspects of global illumination such as shadows, however, few of these methods offer single pass rendering solutions for soft shadows (self and other) and inter-reflections. In contrast, Precomputed Radiance Transfer (PRT) is a real-time computer graphics technique which pre-calculates an object's response to potential incident light. At run time, the actual incident light can be used to quickly illuminate the surface, rendering effects such as soft self-shadows and inter-reflections. In this thesis, we show that by calculating PRT lighting coefficients …
Controlling The Uncontrollable: A New Approach To Digital Storytelling Using Autonomous Virtual Actors And Environmental Manipulation, Matthew J. Colon
Controlling The Uncontrollable: A New Approach To Digital Storytelling Using Autonomous Virtual Actors And Environmental Manipulation, Matthew J. Colon
Master's Theses
In most video games today that focus on a single story, scripting languages are used for controlling the artificial intelligence of the virtual actors. While scripting is a great tool for reliably performing a story, it has many disadvantages; mainly, it is limited by only being able to respond to those situations that were explicitly declared, causing unreliable responses to unknown situations, and the believability of the virtual actor is hindered by possible conflicts between scripted actions and appropriate responses as perceived by the viewer. This paper presents a novel method of storytelling by manipulating the environment, whether physically or …
Exploring The Relationship Of The Closeness Of A Genetic Algorithm's Chromosome Encoding To Its Problem Space, Kevin Mccullough
Exploring The Relationship Of The Closeness Of A Genetic Algorithm's Chromosome Encoding To Its Problem Space, Kevin Mccullough
Master's Theses
For historical reasons, implementers of genetic algorithms often use a haploid binary primitive type for chromosome encoding. I will demonstrate that one can reduce development effort and achieve higher fitness by designing a genetic algorithm with an encoding scheme that closely matches the problem space. I will show that implicit parallelism does not result in binary encoded chromosomes obtaining higher fitness scores than other encodings. I will also show that Hamming distances should be understood as part of the relationship between the closeness of an encoding to the problem instead of assuming they should always be held constant. Closeness to …