Back to Search Start Over

Authoring Hierarchical Road Networks

Authors :
Eric Galin
Bedrich Benes
Eric Guérin
Adrien Peytavie
Modélisation Géométrique, Géométrie Algorithmique, Fractales (GeoMod)
Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS)
Institut National des Sciences Appliquées de Lyon (INSA Lyon)
Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL)
Université de Lyon-École Centrale de Lyon (ECL)
Université de Lyon-Université Lumière - Lyon 2 (UL2)-Institut National des Sciences Appliquées de Lyon (INSA Lyon)
Université de Lyon-Université Lumière - Lyon 2 (UL2)
Source :
Computer Graphics Forum, Computer Graphics Forum, Wiley, 2011, 7, 30, pp.2021-2030. ⟨10.1111/j.1467-8659.2011.02055.x⟩
Publication Year :
2011
Publisher :
HAL CCSD, 2011.

Abstract

International audience; We present a procedural method for generating hierarchical road networks connecting cities, towns and villages over large terrains. Our approach relies on an original geometric graph generation algorithm based on a non-Euclidean metric combined with a path merging algorithm that creates junctions between the different types of roads. Unlike previous work, our method allows high level user control by manipulating the density and the pattern of the network. The geometry of the highways, primary and secondary roads as well as the interchanges andintersections are automatically created from the graph structure by instantiating generic parameterized models.

Details

Language :
English
ISSN :
01677055 and 14678659
Database :
OpenAIRE
Journal :
Computer Graphics Forum, Computer Graphics Forum, Wiley, 2011, 7, 30, pp.2021-2030. ⟨10.1111/j.1467-8659.2011.02055.x⟩
Accession number :
edsair.doi.dedup.....adb376f05864c4c524d36c59438e7b90
Full Text :
https://doi.org/10.1111/j.1467-8659.2011.02055.x⟩