Procedural Modelling of Urban Road Networks

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F14%3A10289460" target="_blank" >RIV/00216208:11320/14:10289460 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1111/cgf.12283" target="_blank" >http://dx.doi.org/10.1111/cgf.12283</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1111/cgf.12283" target="_blank" >10.1111/cgf.12283</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Procedural Modelling of Urban Road Networks

Popis výsledku v původním jazyce

We present a model for growing procedural road networks in and close to cities. The main idea of our paper is that a city cannot be meaningfully simulated without taking its neighbourhood into account. A simple traffic simulation that considers this neighbourhood is then used to grow new major roads and to influence the locations of minor road growth. Waterways are introduced and used to help position the city nuclei on the map. The resulting cities are formed by allowing several smaller settlements togrow together and to form a rich road structure, much like in real world, and require only minimal per-city input, allowing for batch generation.

Název v anglickém jazyce

Procedural Modelling of Urban Road Networks

Popis výsledku anglicky

We present a model for growing procedural road networks in and close to cities. The main idea of our paper is that a city cannot be meaningfully simulated without taking its neighbourhood into account. A simple traffic simulation that considers this neighbourhood is then used to grow new major roads and to influence the locations of minor road growth. Waterways are introduced and used to help position the city nuclei on the map. The resulting cities are formed by allowing several smaller settlements togrow together and to form a rich road structure, much like in real world, and require only minimal per-city input, allowing for batch generation.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2014

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Computer Graphics Forum [online]

ISSN

1467-8659

e-ISSN

—

Svazek periodika

33

Číslo periodika v rámci svazku

6

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

11

Strana od-do

132-142

Kód UT WoS článku

000342802200009

EID výsledku v databázi Scopus

—