• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 12
  • 8
  • 5
  • 1
  • Tagged with
  • 27
  • 27
  • 14
  • 13
  • 12
  • 12
  • 11
  • 10
  • 8
  • 7
  • 6
  • 6
  • 6
  • 6
  • 5
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Smoke Simulation with Perlin Noise

Lin, Shaoye, Sang, Lin January 2012 (has links)
This work is studying real-time generation of smoke simulation based on a particle system. In order to enhance the realism of the effect, we used texture mapping (Perlin noise) and transparency disturbance to shade the 3D smoke. Furthermore, it uses simple physical function to simulate smoke movement. Classical smoke simulation is using a great amount of particles which makes computing more complex. Compared with traditional methods, the method we propose can generate realistic visual effect of smoke in real-time and reduce the time consumed.
2

Half Acute : Spelprojekt till Swedish Game Awards / Half Acute : Game Project for Swedish Game Awards

Nilsson, Mikael, Magnusson, Patrik January 2016 (has links)
I denna rapport kommer vi att beskriva vår process för att utveckla ett spelprojekt som vårt examensarbete genom att vara med och tävla i Sveriges största spelutvecklartävling för studenter, Swedish Game Awards. Spelet handlar om personen Kurt, som har bestämt sig för att ge sig ut för att rädda efter sin kidnappade hund.   I denna rapport förklarar vi hur vi gick tillväga när vi fortsatte utvecklingen av ett spel samt vilka verktyg och metoder vi använde för att fullborda uppgiften, både genom de krav som ställdes från Swedish Game Awards och de krav vi bestämde själva. Vi beskriver de motgångar vi hade och hur vi lyckades lösa problemen. Slutligen kommer vi även redovisa vårt resultat och diskutera kring utvecklingen av spelet, samt dess utvecklingspotential för framtiden. / In this report we are going to describe the development process of our game that we have as our thesis. To be able to have this project as our thesis, we had to enter our game in the game development competition called “Swedish Game Awards”. This competition is only for students, giving them a place to present their game projects. The game is about a guy named Kurt, who decides to go and rescue his kidnapped dog.   We will explain how we went about developing the game and about the different tools and methods we used to complete the project. Both in terms of the demands that is needed to send our project as an entry to the Swedish Game Awards, and in terms of the requirements we decided on by ourselves. We will describe the adversity we had in our project and how we went about solving them. Finally we will also present and discuss our results from the development of the game, and its future potential for further development.
3

Procedurell generering av terräng Perlin noise eller Diamond-Square : med fokus på exekveringstid och framkomlighet / Procedural generation of terrain Perlin noise or Diamond-Square : With focus on execution time and good exploration

Lautakoski, Johan January 2016 (has links)
Arbetet handlar om vilken algoritm som är bäst för att procedurellt generera terräng. Är Diamond-Square bättre eller sämre än vad Perlin noise när de jämförs på exekveringstid och framkomlighet. Algoritmerna är implementerade i Unity där de körs för att få fram exekveringstid och Flood fill används för att ta reda på framkomligheten. Algoritmerna kördes 1000 gånger var på tre olika kartstorlekar för att få fram ett genomsnitt. Resultatet visar att Diamond-Square är snabbare än vad Perlin noise är men Perlin noise har bättre framkomlighet. / This project deals with which algorithm is best for procedural terrain generation. Is Diamond Square better or worse than Perlin noise when they are compared on execution time and exploration. The algorithms are implemented in Unity, where they are tested to get the execution time and Flood Fill is used to determine exploration. The algorithms were run 1000 times each on three different map sizes to obtain an average. The results show that Diamond Square is faster than Perlin noise is but Perlin noise has better exploration.
4

Urbis Terram - Designing and Implementing a Procedural City Generation Tool for Unity3D Game Engine

Najahi, Yakin 27 April 2017 (has links)
The use of procedural content generation is becoming more and more popular in the video game industry. With games such as Minecraft or No Man’s Sky we have seen the potential of PCG in video game creation but also its challenges. In fact, while the processing power and memory capabilities of our machines are unceasingly growing, human capability for content creation doesn’t seem to be able to follow the same pace. Game developers had then to come up with several techniques and methods that will help them generate lots of content for their games while still keeping a certain level of control on the output. Urbis Terram is a procedural city generation tool for Unity3D that allows the creation of complete cities to be used in video games or simulations made with this engine. The goal of this thesis is to tackle the technical challenge of designing and implementing a PCG tool that will help game developers to quickly generate terrains, road networks and allotment spaces for buildings and other urban areas. The goal is to have a unique complete city generation tool that can enable quick game design iterations and can be used to create complex virtual worlds.
5

Procedural city generation using Perlin noise

Frank, Elias, Olsson, Niclas January 2017 (has links)
Context. Procedural content generation is to algorithmically generate content. This has been used in games and is an important tool to create games with large amounts of content using fewer resources. This may allow small developers to create big worlds, which makes the investigation into this area interesting. Objectives. The Procedural generation of cities using Perlin noise is explored. The goal is to nd out if a procedurally generated city using Perlin noise is viable to use in games. Method. An implementation generating cities using Perlin noise has been created and a user study along with data collection tests the cities' viability in games. Result. The implementation succeeds with all the technical requirements such as performance and determinism. The user study shows that the cities created are perceived as viable in games. Conclusion. The cities generated with the implementation seems to be viable in games. The results show that the generated content are percieved as more viable than random generated cities. Furthermore the generation speed is fast enough to be used in an online setting.
6

Procedurell terräng generering : Perlin Noise mot Diamond-square inom framkomlighet och exekveringstid / Procedural terrain generation : Perlin noise versus Diamond-square within accessibility and execution time.

Johansson, Pontus, Sjöberg, Zimon January 2020 (has links)
Målet med projektet är att jämföra algoritmerna Perlin noise och Diamond-square för procedurell terränggererering inom exekveringstid och framkomlighet. Projektet implementerades i Unity i form utav ett editor-verktyg som både genererar terräng och utför diverse tester. Framkomlighetstestet för terrängen är en modifierad version av en Flood fill algoritm och mätningen av exekveringstid utförs med en timer. För att undvika att vara partisk mot någon av algoritmerna har det implementerats flera typer av terränger med varierande egenskaper. Mätningarna som utförs på varje terräng för respektive algoritm testas ett stort antal gång för olika givna storlekar och med varierande frön. Efteråt utförs en analys som visar att Diamond-square definitivtär den snabbaste av de två algoritmerna och att Diamond-square ger högre framkomlighet för större banor, medan Perlin noise visar en mer konsekvent framkomlighet. Framtida relaterade projekt bör inkludera flera modernare algoritmer för att se hur de förhåller sig till Perlin noise och Diamond-square.
7

Creating an Endless Procedural Game World that is Realistic and Purposeful

Ström, Linus January 2021 (has links)
Procedural content generation is a useful tool to use when generating content for games. An issue with this type of content is often the lack of realism and purpose, especially regarding procedurally generated worlds or levels, aswell as outlier bugs, that can block the players progression, that can be hard to find since they could only show up in a few select seeds of the randomized world. This thesis examines the best use of procedural content generation for a game that features an endless world, as well as evaluating the final product against established definitions of the terms "realistic" and "purposeful", while also taking into account the prevention of outliers. The world is constructed as a series of interconnected sections that are generated incrementally as needed, with each section's landscape using Perlin-noise for its topography and A* pathfinding to build paths that ensure that the player can navigate through the randomized terrain and not get stuck. The topography is also modified by different techniques to generate a realistic coastline and feature different areas of interest within a section. The world was evaluated against the established definitions of realism and purposefulness by eight participants that gave the world a high score on all aspects of both definitions. To ensure the validity of the generated content, iterative evaluations were performed that showed no outlier bugs that prevented progressing through the world. The techniques used in this thesis can serve as a good starting ground for continued development of endless worlds.
8

Procedurell generering av volymetrisk terräng på olika beräkningsenheter / Procedural generation of volumetric terrain on different processing units

Mathiason, Jesper January 2016 (has links)
Detta arbete undersöker om de existerande algoritmerna Marching cubes och Perlin noise kan användas för att procedurellt generera terräng. Implementationen av dessa algoritmer genererar en terräng som representeras som en tredimensionell volym, för att lösa problem som kan uppkomma när terrängen representeras av ett tvådimensionellt höjdfält. Vidare parallelliseras kombinationen av dessa algoritmer och anpassas för körning på GPU, där experiment visade att parallelliseringen gav prestandaökning och således kortare genereringstider. / <p>Det finns övrigt digitalt material (t.ex. film-, bild- eller ljudfiler) eller modeller/artefakter tillhörande examensarbetet som ska skickas till arkivet.</p><p>There are other digital material (eg film, image or audio files) or models/artifacts that belongs to the thesis and need to be archived.</p>
9

A Graph-Based Approach to Procedural Terrain

Mijailovic, Vidak January 2015 (has links)
Procedural terrain generation is a field that handles procedural, not by hand, generated realistic looking terrain for use in simulations, video games, movie special effects or art. It allows for creation of vast and far more detailed terrain than humans can create by hand. In this paper a new method for procedural terrain generation is presented. Terrain is generated in three steps. An arbitrarily shaped network oh nodes, a graph, is used as a base to design the shape and layout of terrain features. Common algorithms are used to generate custom terrain features inside the graphs sealed areas and finally the generated terrain is merged into a single piece using a new method. In this manner, more controlled and detailed terrain can be created as the layout and shape of features can be controlled. / Området terräng generering hanterar procedurellt, icke för hand, skapande utav realistisk terräng för användning inom simulationer, data spel, filmers specialeffekter och konst. I denna uppsats presenteras en ny metod för procedurell terräng generation. Terrängen genereras i tre steg. Ett godtyckligt nätverk av noder skapas, en graf, och används som grund för att designa och forma utläggningen av terrängens drag. Kända algoritmer används för att skapa dragen inuti grafens tomma ytor och slutgiltigen sys den genererade terrängen ihop till en sammanhängande helhet med en ny metod. På detta vis kan man skapa mera detaljerad och bättre styrd terräng då man både kan kontrollera dragens former och utläggning. Nyckelord: Terräng, realtid datorgrafik, digital-kartografi, graf-grammatik, Perlin
10

User perception on procedurally generated cities affected with a heightmapped terrain parameter / En användares uppfattning på procedurellt genererade städer som är påverkade av en height-mapped terrängparameter

Brodd, Adam, Eriksson, Andreas January 2019 (has links)
Context: Procedural content generation shortened PCG is a way of letting the computer algorithmically generate data, with little input from programmers. Procedural content generation is a useful tool for developers to create game worlds, content and much more, which can be tedious and time-consuming to do by hand.Objectives: The procedural generation of both a city and height-mapped terrain parameter using Perlin noise and the terrain parameters effect on the city is explored in this thesis. The objective is to find out if a procedurally generated city with a heightmap parameter using Perlin noise is viable for use in games. Methods: An implementation generating both a height-mapped terrain parameter and city using Perlin noise has been created, along with that a user survey to test the generated city and terrain parameters viability in games. Results: This work successfully implemented an application that can generate cities affected with a heightmapped terrain parameter that is viable for use in games. Conclusions: This work concludes that it is possible to generate cities affected with a height-mapped terrain parameter by utilizing the noise algorithm Perlin noise. The generated cities and terrains are both viable and believable for use in games.

Page generated in 0.0725 seconds