A Procedural 2D road network generation approach

Download
index.pdf
2018
Güner, Nevzat Göksan
Show full item record
258
views
106
downloads
Modeling high scaled road networks with many intersections and distant streets takes a serious amount of modelers’ time. The amount of work modelers need can be reduced by generating the basic model procedurally; therefore, modelers spend more time to work on the details. In this thesis, we focus on procedurally generating low detailed and lightweight 2D road network models with dynamic lanes and lines. Our system also has the same basic abilities with the traditional road network modeling tools capable of creating junctions and pavements. In order to make a better performing model, we use straight and arc road segments consisted of minimum amount of polygons. The main focus of this thesis will be creating a 2D procedural road network generation system with decreased polygon and texture costs.
Computer graphics., Computer animation., Computer simulation.
http://etd.lib.metu.edu.tr/upload/12621795/index.pdf
https://hdl.handle.net/11511/27163
Graduate School of Informatics, Thesis

Suggestions

A Novel broad-phase continuous-time collision detection algorithm
Kaya, Tarık; Hacıhabiboğlu, Hüseyin; Department of Game Technologies (2016)
Today’s game development tools rely on realistic physics simulation more than ever. Physics simulation is a highly sophisticated subject, which can be approached from various angles, because of the impossibility of exact simulation. The impossibility of exact simulation for real world physics comes from the requirements of infinite precision, resolution and therefore infinite computational power. Hence the main aim of game physics simulations is making the game-world seem as physically realistic as feasible...
A new approach for better load balancing of visibility detection and target acquisition calculations
Filiz, Anıl Yiğit; Can, Tolga; Department of Computer Engineering (2010)
Calculating visual perception of entities in simulations requires complex intersection tests between the line of sight and the virtual world. In this study, we focus on outdoor environments which consist of a terrain and various objects located on terrain. Using hardware capabilities of graphics cards, such as occlusion queries, provides a fast method for implementing these tests. In this thesis, we introduce an approach for better load balancing of visibility detection and target acquisition calculations b...
A study on conceptual modeling in simulation systems : an extended methodology for KAMA
Aysolmaz Bozlu, Banu E; Demirörs, Onur; Department of Information Systems (2007)
Conceptual modeling is considered to be essential in simulation development activities. However, there are only a few research studies on how to develop conceptual models. One of the important and comprehensive approaches is the methodology developed under the leadership of METU Modeling and Simulation Center (MODSIMMER) for Turkish Armed Forces. The project suggests a methodology to develop mission space conceptual models (GUKAM), and provides a Conceptual Model Development Tool for C4ISR M&S activities, w...
A matching algorithm based on linear features
Atalay, Mehmet Volkan (Elsevier BV, 1998-07-01)
A two step feature matching algorithm which is primarily aimed at problems related to the analysis of aerial images of man-made sites is presented. Only linear features and their geometric attributes are used in the algorithm. First, the rotation between the two images is calculated and then matching by relaxation is performed assuming that there is only translation.
A hybrid single-source shortest path algorithm
Arslan, Hilal; Manguoğlu, Murat (The Scientific and Technological Research Council of Turkey, 2019-01-01)
The single-source shortest path problem arises in many applications, such as roads, social applications, and computer networks. Finding the shortest path is challenging, especially for graphs that contain a large number of vertices and edges. In this work, we propose a novel hybrid method that first sparsifies a given graph by removing most edges that cannot form the shortest path tree and then applies a classical shortest path algorithm to the sparser graph. Removing all the edges that cannot form the shor...
Citation Formats
N. G. Güner, “A Procedural 2D road network generation approach,” M.S. - Master of Science, Middle East Technical University, 2018.
METU IIS - Integrated Information Service open@metu.edu.tr