Dissertations / Theses: 'Computer Graphics - Game Programming'

1

Hung, Cheng-Yu. "Multi-user game development." CSUSB ScholarWorks, 2007. https://scholarworks.lib.csusb.edu/etd-project/3122.

Full text

Abstract:

This project included the development of a multi-user game that takes place in a 3 dimensional world of the computer science department. Basically, the game allows prospective students to meet existing students and faculty in a virtual open house that takes place within the third floor of Jack Brown Hall. Users can walk around Jack Brown Hall and type text messages to chat with each other.

APA, Harvard, Vancouver, ISO, and other styles

2

Alafaireet, Hussain. "Exploring the use of a commercial game engine for the development of educational software." Diss., Rolla, Mo. : Missouri University of Science and Technology, 2009. http://scholarsmine.mst.edu/thesis/pdf/Alafaireet_09007dcc806bfca9.pdf.

Full text

Abstract:

Thesis (M.S.)--Missouri University of Science and Technology, 2009.
Vita. The entire thesis text is included in file. Title from title screen of thesis/dissertation PDF file (viewed August 14, 2009) Includes bibliographical references (p. 160-162).

APA, Harvard, Vancouver, ISO, and other styles

3

Surangi, Vani Indrani. "Game design and development." CSUSB ScholarWorks, 2006. https://scholarworks.lib.csusb.edu/etd-project/3098.

Full text

Abstract:

The project focuses on computer tools suitable for particular game genres and how they are used to develop 3D computer games. As part of learning about the tools, the author developed a 3D computer adventure game called "Adventures of Smiley" using Macromedia Director MX and 3D Studio Max. The game's purpose is to engage children using a friendly interface while they learn about different topics in various subject areas through lessons and puzzles. The research gathered information about the current game industry, technologies and game genres, which can be used as a reference for the beginning level game programmer. The project documentation and the game are also published on the Internet and can be freely accessed online.

APA, Harvard, Vancouver, ISO, and other styles

4

Roden, Timothy E. "Procedural content creation and technologies for 3D graphics applications and games." Thesis, University of North Texas, 2005. https://digital.library.unt.edu/ark:/67531/metadc4726/.

Full text

Abstract:

The recent transformation of consumer graphics (CG) cards into powerful 3D rendering processors is due in large measure to the success of game developers in delivering mass market entertainment software that feature highly immersive and captivating virtual environments. Despite this success, 3D CG application development is becoming increasingly handicapped by the inability of traditional content creation methods to keep up with the demand for content. The term content is used here to refer to any data operated on by application code that is meant for viewing, including 3D models, textures, animation sequences and maps or other data-intensive descriptions of virtual environments. Traditionally, content has been handcrafted by humans. A serious problem facing the interactive graphics software development community is how to increase the rate at which content can be produced to keep up with the increasingly rapid pace at which software for interactive applications can now be developed. Research addressing this problem centers around procedural content creation systems. By moving away from purely human content creation toward systems in which humans play a substantially less time-intensive but no less creative part in the process, procedural content creation opens new doors. From a qualitative standpoint, these types of systems will not rely less on human intervention but rather more since they will depend heavily on direction from a human in order to synthesize the desired content. This research draws heavily from the entertainment software domain but the research is broadly relevant to 3D graphics applications in general.

APA, Harvard, Vancouver, ISO, and other styles

5

Perez, Manuel A. "A language for interactive computer graphics programming." Virtual Press, 1987. http://liblink.bsu.edu/uhtbin/catkey/484784.

Full text

Abstract:

The writer defines graphics-oriented data types and operators as the basis for a graphics-oriented programming language. Most of these data types are not available in today's languages. They are usually defined as structures or records composed of some other basic types. These include points, rectangles, transformations, etc. Some operators, such as vector addition, are defined to work with them.The design and implementation of an interpreter to test some of these graphics data types and operators are discussed.The writer also examines some of the tools needed in a graphics programming environment.

APA, Harvard, Vancouver, ISO, and other styles

6

Fleming, Robert Renka Robert Joseph. "General purpose programming on modern graphics hardware." [Denton, Tex.] : University of North Texas, 2008. http://digital.library.unt.edu/permalink/meta-dc-6112.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Ramakrishnan, S. "A functional approach to graphics programming and modeling." Thesis, This resource online, 1992. http://scholar.lib.vt.edu/theses/available/etd-04212010-092917/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Fleming, Robert. "General Purpose Programming on Modern Graphics Hardware." Thesis, University of North Texas, 2008. https://digital.library.unt.edu/ark:/67531/metadc6112/.

Full text

Abstract:

I start with a brief introduction to the graphics processing unit (GPU) as well as general-purpose computation on modern graphics hardware (GPGPU). Next, I explore the motivations for GPGPU programming, and the capabilities of modern GPUs (including advantages and disadvantages). Also, I give the background required for further exploring GPU programming, including the terminology used and the resources available. Finally, I include a comprehensive survey of previous and current GPGPU work, and end with a look at the future of GPU programming.

APA, Harvard, Vancouver, ISO, and other styles

9

Miller, Ruane. "A study of PostScript as a graphics programming language /." Online version of thesis, 1988. http://hdl.handle.net/1850/11483.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Bexelius, Tobias. "HaGPipe : Programming the graphics pipeline in Haskell." Thesis, Mälardalen University, School of Innovation, Design and Engineering, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-6234.

Full text

Abstract:

In this paper I present the domain specific language HaGPipe for graphics programming in Haskell. HaGPipe has a clean, purely functional and strongly typed interface and targets the whole graphics pipeline including the programmable shaders of the GPU. It can be extended for use with various backends and this paper provides two different ones. The first one generates vertex and fragment shaders in Cg for the GPU, and the second one generates vertex shader code for the SPUs on PlayStation 3. I will demonstrate HaGPipe's many capabilities of producing optimized code, including an extensible rewrite rule framework, automatic packing of vertex data, common sub expression elimination and both automatic basic block level vectorization and loop vectorization through the use of structures of arrays.

APA, Harvard, Vancouver, ISO, and other styles

11

Potter, Ralph. "Programming models for heterogeneous systems with application to computer graphics." Thesis, University of Bath, 2017. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.760928.

Full text

Abstract:

For over a decade, we have seen a plateauing of CPU clock rates, primarily due topower and thermal constraints. To counter these problems, processor architects have turned to both multi-core and heterogeneous processors. Whilst the use of heterogeneous processors provides a route to reducing energy con-sumption, this comes at the cost of increased complexity for software developers. In this thesis, we explore the development of C++-based programming models and frameworks which enable the efficient use of these heterogeneous platforms, and the application of these programming models to problems from the field of visual computing. Two recent specifications for heterogeneous computing: SYCL and Heterogeneous System Architecture, share the common goal of providing a foundation for developing heterogeneous programming models. In this thesis, we provide early evaluations of the suitability of these two new platforms as foundations for building higher-level domain-specific abstractions. We drawing upon two use cases from the field of visual computing: image processing and ray tracing; and explore the development and use of domain-specific C++ abstractions layered upon these platforms. We present a domain-specific language which generates optimized image processing kernels by deeply embedding within SYCL. By combining simple primitives into more complex kernels, we are able to eliminate intermediate memory accesses and improved performance. We also describe Offload for HSA: a single-source C++14 compiler and programming model for Heterogeneous System Architecture. The pervasive shared virtual memory offered by HSA allows us to reduce execution overheads and relax constraints imposed by SYCL’s programming model, leading to significant performance improvements. Performance optimization on heterogeneous systems is a challenging task. We build upon Offload to provide RTKit, a framework for exploring the optimization space of ray tracing algorithms on heterogeneous systems. Finally, we conclude by discussing challenges raised by our work and open problems that must be resolved in order to unify C++ and heterogeneous computing.

APA, Harvard, Vancouver, ISO, and other styles

12

Dziak, Nancy Jo. "Programming computer graphics and the development of concepts in geometry." The Ohio State University, 1985. http://rave.ohiolink.edu/etdc/view?acc_num=osu1343403456.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Parborg, Sebastian, and Rasmus Holm. "Generative design of game graphics and levels." Thesis, Linköpings universitet, Interaktiva och kognitiva system, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-149036.

Full text

Abstract:

This thesis describes the implementation and evaluation of a modular approach for generating 2D side-scroller game levels from a procedurally generated 3D world. Manually generating large amounts of game levels can take considerable amounts of time, and it maybe desirable to automate this process, using procedural content generation. The problem with using procedural content generation is that it is hard to generate coherent game levels. We implement a modular pipeline which, given a set of heightmaps, generates a 3Dworld. From this world, 2D game levels are generated by pathing and extracting terrain features which influence the content in the game levels. The resulting 2D game levels will, using our approach, have a coherent and logical look. The game levels themselves do not contain any interesting gameplay. Instead they rely on a game level designer to add gameplay elements. The resulting modular implementation is considered a success, it proves that it is possible to generate 2D game levels from a procedurally generated 3Dworld, using the features of that world.

APA, Harvard, Vancouver, ISO, and other styles

14

Chandler, Simon Robert. "The development of a colour graphics workstation." Thesis, University of Bath, 1987. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.376291.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Bilderback, Mark Leslie. "Graphics.c, a simplified graphics application programming interface for the X Window environment." Virtual Press, 1995. http://liblink.bsu.edu/uhtbin/catkey/935938.

Full text

Abstract:

An often overlooked area of graphics is the ability of application programs to create graphical images. Many programs exist which allow creation interactively, but few offer the same ability for noninteractive application programs. By allowing an application program to create graphical images more user friendly programs may be created by programmers.
Department of Computer Science

APA, Harvard, Vancouver, ISO, and other styles

16

Muaweyah, Amer. "Game skeletons in Game Maker for the course Design and Programming of Computer Games." Thesis, Linköping University, Department of Computer and Information Science, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-50777.

Full text

Abstract:

This report is written as a summary of the solution to the problem that the staff for the course TDDD23 at the Swedish university Linköpings universitet wanted two computer game skeletons. One for a scrolling shooter game and one for a strategy game. The games the staff wanted were to be like two existing games. The scrolling shooter was to be like the scrolling shooter from the tutorial GM Tutorial Scrolling Shooter[1]. The strategy game was to be like an existing game called Ancient War[2]. There were some additional requirements that the games had to fulfill. The games were created using Game Maker. It is an easy to use program for creating small computer games. The result of the project was two game skeletons. One for a scrolling shooter game and one for a strategy game. The skeletons were according to the requirements stated.

APA, Harvard, Vancouver, ISO, and other styles

17

Areizaga, Ander. "Programming learning games : Identification of game design patterns in programming learning games." Thesis, Högskolan i Skövde, Institutionen för informationsteknologi, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-17230.

Full text

Abstract:

There is a high demand for program developers, but the dropouts from computer science courses are also high and course enrolments keep decreasing. In order to overcome that situation, several studies have found serious games as good tools for education in programming learning. As an outcome from such research, several game solutions for programming learning have appeared, each of them using a different approach. Some of these games are only used in the research field where others are published in commercial stores. The problem with commercial games is that they do not offer a clear map of the different programming concepts. This dissertation addresses this problem and analyses which fundamental programming concepts that are represented in commercial games for programming learning. The study also identifies game design patterns used to represent these concepts. The result of this study shows topics that are represented more commonly in commercial games and what game design patterns are used for that. This thesis identifies a set of game design patterns in the 20 commercial games that were analysed. A description as well as some examples of the games where it is found is included for each of these patterns. As a conclusion, this research shows that from the list of the determined fundamental programming topics only a few of them are greatly represented in commercial games where the others have nearly no representation. This shows potential spots for future research in games for programming teaching.

APA, Harvard, Vancouver, ISO, and other styles

18

Buckthal, Eric D. ebucktha. "JUICINESS IN CITIZEN SCIENCE COMPUTER GAMES: ANALYSIS OF A PROTOTYPICAL GAME." DigitalCommons@CalPoly, 2014. https://digitalcommons.calpoly.edu/theses/1278.

Full text

Abstract:

Incorporating the collective problem-solving skills of non-experts could ac- celerate the advancement of scientific research. Citizen science games leverage puzzles to present computationally difficult problems to players. Such games typ- ically map the scientific problem to game mechanics and visual feed-back helps players improve their solutions. Like games for entertainment, citizen science games intend to capture and retain player attention. “Juicy” game design refers to augmented visual feedback systems that give a game personality without modi- fying fundamental game mechanics. A “juicy” game feels alive and polished. This thesis explores the use of “juicy” game design applied to the citizen science genre. We present the results of a user study in its effect on player motivation with a prototypical citizen science game inspired by clustering-based E. coli bacterial strain analysis.

APA, Harvard, Vancouver, ISO, and other styles

19

Ståhl, Fanny, and Hanna Holmgren. "Animated vs. Static graphics in a video game : How does animated and static graphics affect the user experience in a game?" Thesis, Linköpings universitet, Institutionen för datavetenskap, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-132313.

Full text

Abstract:

Animation in video game graphics is in some cases a necessity for the game’s mechanics to beproperly communicated to the player. In other cases, it is purely an addition to the game’s expression.In the cases where gameplay is not dependant on animation, how exactly does the animationaffect the gameplay experience? This study examines whether or not there are differencesin user experience when static and animated graphic are compared to one another. To do this,30 test participants played two versions of the same game - one with almost exclusively staticgraphic, and one including more animated graphical elements. The test persons were observedduring the test, and answered questionnaires which examined their emotions using the PANAS-Xquestionnaire and levels of immersion using the Immersive Experience Questionnaire. Wealso included a demographic questionnaire to collect data on the participants’ backgrounds, incase it had any impact on the tests and the overall results. The results of the test showed thatthe two versions did not differ much in how they were perceived - not in emotional responsenor feelings of immersion. Despite this, the preference of the users were weighed towards theanimated version. The reason for this can not be concluded with help of the data collected.

APA, Harvard, Vancouver, ISO, and other styles

20

Yeh, Chih Lung. "A framework proposal for algorithm animation systems." Thesis, Nelson Mandela Metropolitan University, 2006. http://hdl.handle.net/10948/d1019680.

Full text

Abstract:

The learning and analysis of algorithms and algorithm concepts are challenging to students due to the abstract and conceptual nature of algorithms. Algorithm animation is a form of technological support tool which encourages algorithm comprehension by visualising algorithms in execution. Algorithm animation can potentially be utilised to support students while learning algorithms. Despite widespread acknowledgement for the usefulness of algorithm animation in algorithm courses at tertiary institutions, no recognised framework exists upon which algorithm animation systems can be effectively modelled. This dissertation consequently focuses on the design of an extensible algorithm animation framework to support the generation of interactive algorithm animations. A literature and extant system review forms the basis for the framework design process. The result of the review is a list of requirements for a pedagogically effective algorithm animation system. The proposed framework supports the pedagogic requirements by utilising an independent layer structure to support the generation and display of algorithm animations. The effectiveness of the framework is evaluated through the implementation of a prototype algorithm animation system using sorting algorithms as a case study. This dissertation is successful in proposing a framework to support the development of algorithm animations. The prototype developed will enable the integration of algorithm animations into the Nelson Mandela Metropolitan University’s teaching model, thereby permitting the university to conduct future research relating to the usefulness of algorithm animation in algorithm courses.

APA, Harvard, Vancouver, ISO, and other styles

21

Myles, Ashish. "Linear programming approach to fitting splines through 3D channels." [Gainesville, Fla.] : University of Florida, 2004. http://purl.fcla.edu/fcla/etd/UFE0006260.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Martin, Walter E. "Cview, a graphical program generator for the C programming language /." Online version of thesis, 1988. http://hdl.handle.net/1850/10224.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Wang, Yangzihao. "Gunrock| A Programming Model and Implementation for Graph Analytics on Graphics Processing Units." Thesis, University of California, Davis, 2017. http://pqdtopen.proquest.com/#viewpdf?dispub=10251096.

Full text

Abstract:

The high-performance, highly parallel, fully programmable modern Graphics Processing Unit's high memory bandwidth, computing power, excellent peak throughput, and energy efficiency brings acceleration to regular applications that have extensive data parallelism, regular memory access patterns, and modest synchronizations. However, for graph analytics, the inherent irregularity of graph data structures leads to irregularity in data access and control flow, making efficient graph analytics on GPUs a significant challenge. Despite some promising specialized GPU graph algorithm implementations, parallel graph analytics on the GPU in general still faces two major challenges. The first is the programmability gap between low-level implementations of specific graph primitives and a general graph processing system. Programming graph algorithms on GPUs is difficult even for the most skilled programmers. Specialized GPU graph algorithm implementations do not generalize well since they often couple a specific graph computation to a specific type of parallel graph operation. The second is the lack of a GPU-specific graph processing programming model. High-level GPU programming models for graph analytics often recapitulate CPU programming models and do not compare favorably in performance with specialized implementations due to different kinds of overhead introduced by maintaining a high-level framework.

This dissertation seeks to resolve the conflict of programmability and performance for graph analytics on the GPU by designing a GPU-specific graph processing programming model and building a graph analytics system on the GPU that not only allows quick prototyping of new graph primitives but also delivers the performance of customized, complex GPU hardwired graph primitives. To achieve this goal, we present a novel data-centric abstraction for graph operations that allows programmers to develop graph primitives at a high level of abstraction while simultaneously delivering high performance by incorporating several profitable optimizations, which previously were only applied to different individual graph algorithm implementations on the GPU, into the core of our implementation, including kernel fusion, push-pull traversal, idempotent traversal, priority queues, and various workload mapping strategies. We design and implement a new graph analytics system, Gunrock, which contains a set of simple and flexible graph operation APIs that can express a wide range of graph primitives at a high level of abstraction. Using Gunrock, we implement a large set of graph primitives, which span from traversal-based algorithms and ranking algorithms, to triangle counting and bipartite-graph-based algorithms. All of our graph primitives achieve comparable performance to their hardwired counterparts and significantly outperform previous programmable GPU abstractions.

APA, Harvard, Vancouver, ISO, and other styles

24

Björklund, Henrik. "Combinatorial Optimization for Infinite Games on Graphs." Doctoral thesis, Uppsala University, Department of Information Technology, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-4751.

Full text

Abstract:

Games on graphs have become an indispensable tool in modern computer science. They provide powerful and expressive models for numerous phenomena and are extensively used in computer- aided verification, automata theory, logic, complexity theory, computational biology, etc.

The infinite games on finite graphs we study in this thesis have their primary applications in verification, but are also of fundamental importance from the complexity-theoretic point of view. They include parity, mean payoff, and simple stochastic games.

We focus on solving graph games by using iterative strategy improvement and methods from linear programming and combinatorial optimization. To this end we consider old strategy evaluation functions, construct new ones, and show how all of them, due to their structural similarities, fit into a unifying combinatorial framework. This allows us to employ randomized optimization methods from combinatorial linear programming to solve the games in expected subexponential time.

We introduce and study the concept of a controlled optimization problem, capturing the essential features of many graph games, and provide sufficent conditions for solvability of such problems in expected subexponential time.

The discrete strategy evaluation function for mean payoff games we derive from the new controlled longest-shortest path problem, leads to improvement algorithms that are considerably more efficient than the previously known ones, and also improves the efficiency of algorithms for parity games.

We also define the controlled linear programming problem, and show how the games are translated into this setting. Subclasses of the problem, more general than the games considered, are shown to belong to NP intersection coNP, or even to be solvable by subexponential algorithms.

Finally, we take the first steps in investigating the fixed-parameter complexity of parity, Rabin, Streett, and Muller games.

APA, Harvard, Vancouver, ISO, and other styles

25

Myjak, Michael D. (Michael David). "Computer Graphics Primitives and the Scan-Line Algorithm." Thesis, University of North Texas, 1988. https://digital.library.unt.edu/ark:/67531/metadc500544/.

Full text

Abstract:

This paper presents the scan-line algorithm which has been implemented on the Lisp Machine. The scan-line algorithm resides beneath a library of primitive software routines which draw more fundamental objects: lines, triangles and rectangles. This routine, implemented in microcode, applies the A(BC)*D approach to word boundary alignments in order to create an extremely fast, efficient, and general purpose drawing primitive. The scan-line algorithm improves on previous methodologies by limiting the number of CPU intensive instructions and by minimizing the number of words referenced. This paper will describe how to draw scan-lines and the constraints imposed upon the scan-line algorithm by the Lisp Machine's hardware and software.

APA, Harvard, Vancouver, ISO, and other styles

26

Pell, Barney Darryl. "Strategy generation and evaluation for meta-game playing." Thesis, University of Cambridge, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.308363.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Trout, Terry Thoke. "Design of computer animation languages /." Title page, contents and abstract only, 1990. http://web4.library.adelaide.edu.au/theses/09SM/09smt861.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Unsal, Omur. "Two-person zero-sum network-interdiction game with multiple inspector types." Thesis, Monterey, California : Naval Postgraduate School, 2010. http://edocs.nps.edu/npspubs/scholarly/theses/2010/Jun/10Jun%5FUnsal.pdf.

Full text

Abstract:

Thesis (M.S. in Operations Research)--Naval Postgraduate School, June 2010.
Thesis Advisor(s): Wood, R. Kevin ; Second Reader: Salmeron, Javier. "June 2010." Description based on title screen as viewed on July 14, 2010. Author(s) subject terms: Two-person zero-sum network-interdiction game, game theoretic network interdiction, column generation, pure inspection-assignment strategy, inspector-to-edge assignment and mixed strategies, marginal probability, Cournet's simultaneous play game. Includes bibliographical references (p. 47-48). Also available in print.

APA, Harvard, Vancouver, ISO, and other styles

29

Toledo-Ramirez, Rommel. "Design of an object oriented and modular architecture for a naval tactical simulator using Delta3D's game manager." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2006. http://library.nps.navy.mil/uhtbin/hyperion/06Sep%5FToledo%5FRamirez.pdf.

Full text

Abstract:

Thesis (M.S. in Modeling, Virtual Environments and Simulation (MOVES))--Naval Postgraduate School, September 2006.
Thesis Advisor(s): Perry L. McDowell, Rudolph P. Darken. "September 2006." Includes bibliographical references (p. 59-60). Also available in print.

APA, Harvard, Vancouver, ISO, and other styles

30

Pursel, Eugene Ray. "Synthetic vision : visual perception for computer generated forces using the programmable graphics pipeline /." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2004. http://library.nps.navy.mil/uhtbin/hyperion/04Sep%5FPursel.pdf.

Full text

Abstract:

Thesis (M.S. in Modeling, Virtual Environments and Simulation (MOVES))--Naval Postgraduate School, Sept. 2004.
Thesis Advisor(s): Christian J. Darken. Includes bibliographical references (p. 93-95). Also available online.

APA, Harvard, Vancouver, ISO, and other styles

31

Lundwall, Clara. "Creating guidelines for game character designs : Bachelor thesis in the subject of computer graphics arts." Thesis, Luleå tekniska universitet, Institutionen för konst, kommunikation och lärande, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-64970.

Full text

Abstract:

This thesis will address the subject of character design for games. I will look into developing a method for creating a design template that one can use as basic guidelines when designing a character. The thesis includes research work revolving the subject of how shapes and colors are used to convey a game character’s personality and identity without dialogue or context. How the use of different poses and combinations of lines and shapes help define a character and the essence of the characters role in the game. The essay includes the creation of a module, how it would be used in a character design pipeline, and also ideas on how the module could be further developed. The module is tested by being used to create three different characters and the result is presented along with an evaluation of the usability of the module in a design pipeline. The summary and discussion includes how the module might be useful for less experienced artist, whilst redundant for the more experienced. How the module gave an initial boost and starting point in the designing of the three characters in this essay is also discussed.
Denna uppsatts kommer att behandla ämnet karaktärsdesign för spel. Jag kommer att undersöka hur man utvecklar en metod för att skapa en designmall som man kan använda som grundläggande riktlinjer när man utformar en karaktär. Avhandlingen innehåller forskning som undersöker hur former och färger används för att förmedla en spelkaraktärs personlighet och identitet utan dialog eller sammanhang. Hur användningen av olika poseringar och kombinationer av linjer och former hjälper till att definiera en karaktär och karaktärens roll i spelet. I uppsatsen ingår skapandet av en modul, hur den skulle användas i en karaktärsdesign pipeline, och även idéer om hur modulen skulle kunna vidareutvecklas. Modulen testas genom att användas för att skapa tre olika karaktärer och resultatet presenteras tillsammans med en utvärdering av modulens användbarhet i en designpipeline. Sammanfattningen och diskussionen behandlar hur modulen kan vara användbar för mindre erfarna konstnärer, samtidigt som den kanske är överflödiga för de mer erfarna. Hur modulen gav ett första steg och utgångspunkt i utformningen av de tre karaktärerna i denna uppsats diskuteras också.

APA, Harvard, Vancouver, ISO, and other styles

32

Wu, Penn Pinlung. "Development of a Career-Oriented Instructional Design Model for Game Programming." NSUWorks, 2012. http://nsuworks.nova.edu/gscis_etd/339.

Full text

Abstract:

This dissertation proposal begins with a discussion about how the education of game programmers was not meeting the needs of the game industry. With this problem identified, this study proceeded to verify the existence of disparities of current game programming curricula. The findings from the literature review were able to: (a) justify the need to develop a career-oriented instructional design model for education of game programming; (b) identify the disparities that caused the mismatch of instructional content between academia and the game industry; (c) review research that contributed to the identification of three disparities: curriculum objectives and structure, instructional content, and curriculum orientation; (d) discuss theories and models of instructional design, student engagement, and related pedagogies; and (e) explore how these theories and models might be instrumental in improving education of game programming. The results obtained from the literature review were also used to formulate guidelines for investigating the status of currently available curricula in game programming. The research design and the research methods utilized by this study to examine the research questions are also described in detail. Four research questions were used to guide the study with the goal of identifying or forming a guiding principle for developing an instructional design model for a career-oriented education of game programming professionals. The results of this study indicated that all of the investigated game programming curricula had not yet produced graduates whom the game companies are interested in hiring as game programmers and that educational institutions had missed an opportunity to equip students with the proper programming skills for the game industry. Furthermore, this study identified that an accreditation standard as well as an industry-accepted instructional design model was not yet available to reflect the personnel hiring requirements of the game industry. The curriculum and coursework must be career-oriented and instructional content must center on game programming. Game programming pedagogy must lead to development of core competencies. In reviewing these findings, the guiding principles for developing an instructional design model became clear. The contribution of this study was to present an immediately applicable instructional design model that could be used as a basis by schools to create or fine tune their game programming curricula. The completed model is provided as an attachment to this dissertation. This proposed instructional design model is intended to provide an initial basis towards a solution to minimize the disparities between academia and the game industry in educational areas of curriculum orientation, curriculum objectives and structure, and instructional content. As with any problem solution, future study and analysis should be done in order to optimize and standardize a game programming curriculum that will be accepted by the game industry as well as accredited by a mutually accepted accreditation body.

APA, Harvard, Vancouver, ISO, and other styles

33

Wilander, Hjalmar. "Player experience from 3D game components : A theoretical and empirical look at computer graphics in practice." Thesis, Linköpings universitet, Institutionen för datavetenskap, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-160094.

Full text

Abstract:

There is currently little research about how the aesthetics of a game affects the perceived PX. Especially, the aesthetics of the individual 3D game components, such as characters, enemies and environmental objects. This thesis project studies different design principles and approaches to create 3D game components. These are used in practice to create 3D game components for a video game. The 3D game components are evaluated with qualitative and quantitative methods, with the intention to find a method for creating 3D game components that evoke a certain PX. The results show that it is possible to create 3D game components that evoke positive emotions, by using color psychology, animation theory and by designing from the developers own feelings and experiences.

APA, Harvard, Vancouver, ISO, and other styles

34

Koffi, Cole Mahoukau. "Video game development with 3D Studio Max and the XNA framework." CSUSB ScholarWorks, 2007. https://scholarworks.lib.csusb.edu/etd-project/3228.

Full text

Abstract:

The purpose of this project on game design and development is to experiment with actual technology tools used in computer games and get experience in three deminsional game development using 3D Studio Max and Microsoft XNA.

APA, Harvard, Vancouver, ISO, and other styles

35

Huang, Angela Tzujui. "Develop heuristics to the popular Minesweeper game." CSUSB ScholarWorks, 2004. https://scholarworks.lib.csusb.edu/etd-project/2545.

Full text

Abstract:

This project describes Automine, a program intended to aid in the solving of the Minesweeper computer game. Automine is based on the Linux xwindow C program with xwindow graphic library. The program uses heuristics and probability statistics to help in determining safe squares and squares concealing mines with the goal of allowing a player to achieve minimal time performance. The source code for Automine and for a game simulation is provided in the appendices.

APA, Harvard, Vancouver, ISO, and other styles

36

Gaconnet, Christopher James Tarau Paul. "Force-directed graph drawing and aesthetics measurement in a non-strict pure functional programming language." [Denton, Tex.] : University of North Texas, 2009. http://digital.library.unt.edu/ark:/67531/metadc12125.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Boggus, Matthew J. "Modeling, Evaluation, Editing, and Illumination of Three Dimensional Mazes and Caves for Computer Games." The Ohio State University, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=osu1340034360.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Douglas, Brady D. "Using Video Game Development as a Stepping Stone into the World of Technology." Ashland University Honors Theses / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=auhonors1525247444242345.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Karlsson, Elin, and Lucas Persson. "Performance in game environments with Shadow Maps based on Level of Detail." Thesis, Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-18391.

Full text

Abstract:

Background To be able to push game standards further and further, different graphics techniques have to be implemented by game developers. By utilizing some of those techniques, comes cost in the form of performance issues. Level of detail (LOD) is an optimization technique which uses several different variations of a model and distance from the viewer to determine which model should be rendered. Shadow mapping is, on the contrary from level of detail, a costly technique which aims to create as realistically looking shadows as possible. Objectives The aim of this thesis is to examine whether a novel LOD technique and shadow map technique called LOD-SM can achieve less render time versus using a standard implementation of shadow mapping. This is achieved by using the Unity game engine in which the LOD-SM technique is implemented. With Unity, measurements will be taken to determine if the technique is a viable optimization option in future game development. Methods The methods used to answer the paper’s research question were a pilot user study and a performance study. 20 participants were part of the pilot study, and were asked to rate their perception of shadows shown on a screen in front of them. This yielded results of which shadows the participants noticed differences for. The results were then implemented into Unity and measured with the LOD-SM technique. Results The pilot study showed that user does not notice any differences in 30% decreased polycount-shadows when in a multiple building environment. The gathered results from the performance experiment showed that the LOD-SM technique saved between ∼17% up to ∼70% in render time, compared to a regular implementation of shadow mapping. Conclusions In conclusion, a viable optimization option was found which is to lower a shadow maps appearance based on buildings LODs because as the results has shown, users does not notice the lowering of LODs up to 30% when in a multiple building area. It was discovered that by measuring the LOD-SM technique, clear evidence of optimization was found when using the technique versus using a normal implementation of shadow mapping. Developers would have to consider the size of project and its models before implementing the LOD-SM technique, as it might not be viable for projects with a total polycount of less than 100 000 polygons.

APA, Harvard, Vancouver, ISO, and other styles

40

Hoffenberg, Steven. "The tug function : a method of context sensitive dot structuring for digital halftones /." Online version of thesis, 1990. http://hdl.handle.net/1850/11500.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Abate, Shalom (Shalom A. ). "A numerical analysis of the NPA semidenite programming hierarchy for the Mod P game." Thesis, Massachusetts Institute of Technology, 2017. http://hdl.handle.net/1721.1/112827.

Full text

Abstract:

Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2017.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 67-68).
The Mod P game is a generalization of the famous CHSH game [6] to a field of order p. The CHSH game corresponds to the Mod P game for the value of p = 2. The CHSH game was one of the earliest and most important results in quantum mechanics because it predicted a clear and experimentally verifiable separation between classical and quantum physics in the form of a Bell's inequality violation. In this thesis, we study the maximum winning probability for the Mod P game over the set of quantum strategies. For p = 2, an early result by Tsirelson [15] showed that the maximum winning probability by a quantum strategy is 0:854. This result is also tight in that it is achievable. Here we are interested in studying the game for values of p > 2 which has seen little progress over the years. This research thesis serves two purposes. The first is to create a self contained reference for some of the most important results in the area. Among these results, a prominent work is the NPA hierarchy [13] of semidenite programs for testing whether a given bipartite correlation corresponds to a valid quantum mechanical experiment. The second part of this thesis is an implementation of this hierarchy for the Mod P game. In the first level of the hierarchy, we obtain numerical results that match analytic upper bounds by Bavarian and Shor [2]. We also nd that the Bavarian and Shor bound is tighter than the first level NPA hierarchy value for a prime power p. In a collaborative work with Matthew Coudron we also present an approach for a semidenite relaxation of the Mod P game using unitary operators. This approach brings us closer to achieving an exact analytic solution for the winning probability of the Mod P game.
by Shalom Abate.
M. Eng.

APA, Harvard, Vancouver, ISO, and other styles

42

Pei, Mo Mo. "Modeling the performance of many-core programs on GPUs with advanced features." Thesis, University of Macau, 2012. http://umaclib3.umac.mo/record=b2592954.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Goff, Roger Allen. "Complexity measurement of a graphical programming language and comparison of a graphical and a textual design language." Thesis, Virginia Tech, 1987. http://hdl.handle.net/10919/45686.

Full text

Abstract:

For many years the software engineering community has been attacking the software reliability problem on two fronts. First via design methodologies, languages and tools as a precheck on quality and second by measuring the quality of produced software as a postcheck. This research attempts to unify the approach to creating reliable software by providing the ability to measure the quality of a design prior to its implementation. Also presented is a comparison of a graphical and a textual design language in an effort to support cognitive science research findings that the human brain works more effectively in images than in text.

Master of Science

APA, Harvard, Vancouver, ISO, and other styles

44

Marais, Craig. "Guidelines for the use of the Indie approach in game development projects in the context of a capstone experience." Thesis, Nelson Mandela Metropolitan University, 2013.

Find full text

Abstract:

This research addresses the challenges associated with the supervision of game development projects as part of a capstone experience. The context of this research is the capstone experience as undertaken by third year software development students who have chosen to develop a game for their project at the School of Information and Communication Technology (ICT) at the Nelson Mandela Metropolitan University (NMMU). This research begins by determining the curricular requirements with respect to the capstone experience for Information Technology (IT) qualifications. This is done by investigating the applicable documentation at the international, national and departmental levels. The position of game development as a sub-category of software development is established and the Indie paradigm is investigated as a further sub-category of game development. Furthermore, the Indie paradigm is investigated through in-depth analyses of the techniques used in the development of ten Indie games. This investigation serves to identify the commonly used techniques in the Indie paradigm. The research presents a case study of the game development projects at the School of ICT at the NMMU for the period from 2009 to 2013. This case study combined with the techniques identifed from the Indie paradigm forms the basis of the guidelines presented by this research. The guidelines are subject to a review by an industry expert. The review takes the form of an expert interview, which serves to verify the guidelines. This research concludes by demonstrating alignment with the objectives it set out to achieve and motivating the success of the research conducted.

APA, Harvard, Vancouver, ISO, and other styles

45

Nelson, Christopher University of Ballarat. "Spiritual Art: evoking the numinous using a 3D computer game engine." University of Ballarat, 2007. http://archimedes.ballarat.edu.au:8080/vital/access/HandleResolver/1959.17/12793.

Full text

Abstract:

The Seven Valleys is an interactive 3D installation based artwork inspired by mystical writings of the Bahá'í Faith. Created as a modification of the firstperson shooter Unreal Tournament 2003 (Epic, 2003) it subverts the original paradigm of the game to create an experience of the numinous, which in spirit, is diametrically opposed to the original intent of the gameplay design. This artwork presents an exploration of, and allusion to, the often subtle and illusive concepts found in the sacred treatise The Seven Valleys (Bahá'u'lláh, 1991) in which the user engages in an experiential journey through the work. The user is faced with conditions and situations that provide motivation to question, explore and attempt to fathom the abstract sense of the numinous. Each of The Seven Valleys contains its own individual mysteries while at the same time contributing its part to the telling of a collective story.
Master of Arts

APA, Harvard, Vancouver, ISO, and other styles

46

Nelson, Christopher. "Spiritual Art : evoking the numinous using a 3D computer game engine." Thesis, University of Ballarat, 2007. http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/43390.

Full text

Abstract:

The Seven Valleys is an interactive 3D installation based artwork inspired by mystical writings of the Bahá'í Faith. Created as a modification of the firstperson shooter Unreal Tournament 2003 (Epic, 2003) it subverts the original paradigm of the game to create an experience of the numinous, which in spirit, is diametrically opposed to the original intent of the gameplay design. This artwork presents an exploration of, and allusion to, the often subtle and illusive concepts found in the sacred treatise The Seven Valleys (Bahá'u'lláh, 1991) in which the user engages in an experiential journey through the work. The user is faced with conditions and situations that provide motivation to question, explore and attempt to fathom the abstract sense of the numinous. Each of The Seven Valleys contains its own individual mysteries while at the same time contributing its part to the telling of a collective story.
Master of Arts

APA, Harvard, Vancouver, ISO, and other styles

47

Nelson, Christopher. "Spiritual Art: evoking the numinous using a 3D computer game engine." University of Ballarat, 2007. http://archimedes.ballarat.edu.au:8080/vital/access/HandleResolver/1959.17/14628.

Full text

Abstract:

The Seven Valleys is an interactive 3D installation based artwork inspired by mystical writings of the Bahá'í Faith. Created as a modification of the firstperson shooter Unreal Tournament 2003 (Epic, 2003) it subverts the original paradigm of the game to create an experience of the numinous, which in spirit, is diametrically opposed to the original intent of the gameplay design. This artwork presents an exploration of, and allusion to, the often subtle and illusive concepts found in the sacred treatise The Seven Valleys (Bahá'u'lláh, 1991) in which the user engages in an experiential journey through the work. The user is faced with conditions and situations that provide motivation to question, explore and attempt to fathom the abstract sense of the numinous. Each of The Seven Valleys contains its own individual mysteries while at the same time contributing its part to the telling of a collective story.
Master of Arts

APA, Harvard, Vancouver, ISO, and other styles

48

Meeder, Ian Harris. "Intelligent Cinematic Camera Control for Real-Time Graphics Applications." DigitalCommons@CalPoly, 2020. https://digitalcommons.calpoly.edu/theses/2120.

Full text

Abstract:

E-sports is currently estimated to be a billion dollar industry which is only growing in size from year to year. However the cinematography of spectated games leaves much to be desired. In most cases, the spectator either gets to control their own freely-moving camera or they get to see the view that a specific player sees. This thesis presents a system for the generation of cinematically-pleasing views for spectating real-time graphics applications. A custom real-time engine has been built to demonstrate the effect of this system on several different game modes with varying visual cinematic constraints, such as the rule of thirds. To create the cinematic views, we encode cinematic rules as cost functions that are fed into a non-linear least squares solver. These cost functions rely on the geometry of the scene, minimizing residuals based on the 3D positions and 2D reprojections of the geometry. The final cinematic view is found by altering camera position and angle until a local minimum is met. The system was evaluated by comparing video output from a traditional rigidly constrained camera and the results of our algorithm’s optimally solved views. User surveys are then used to qualitatively evaluate the system. The results of these surveys do not statistically find a preference between the cinematic views and the rigidly constrained views. In addition, we present performance and timing considerations for the system, reporting that the system can operate within modern expectations of latency when enough constraints are placed on the non-linear least squares solver.

APA, Harvard, Vancouver, ISO, and other styles

49

Haag, Roger. "Programming the INTEL 8086 microprocessor for GRADS : a graphic real-time animation display system." Thesis, McGill University, 1985. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=65929.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Risley, Michael. "Accelerating Computational Algorithms." VCU Scholars Compass, 2013. http://scholarscompass.vcu.edu/etd/3288.

Full text

Abstract:

Mathematicians and computational scientists are often limited in their ability to model complex phenomena by the time it takes to run simulations. This thesis will inform interested researchers on how the development of highly parallel computer graphics hardware and the compiler frameworks to exploit it are expanding the range of algorithms that can be explored on affordable commodity hardware. We will discuss the complexities that have prevented researchers from exploiting advanced hardware as well as the obstacles that remain for the non-computer scientist.

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic 'Computer Graphics - Game Programming'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles