Show simple item record

dc.contributor.authorGalin, Ericen_US
dc.contributor.authorPeytavie, Adrienen_US
dc.contributor.authorGuérin, Ericen_US
dc.contributor.authorBenes, Bedrichen_US
dc.contributor.editorBing-Yu Chen, Jan Kautz, Tong-Yee Lee, and Ming C. Linen_US
dc.date.accessioned2015-02-27T16:13:40Z
dc.date.available2015-02-27T16:13:40Z
dc.date.issued2011en_US
dc.identifier.issn1467-8659en_US
dc.identifier.urihttp://dx.doi.org/10.1111/j.1467-8659.2011.02055.xen_US
dc.description.abstractWe 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 and intersections are automatically created from the graph structure by instantiating generic parameterized models.en_US
dc.publisherThe Eurographics Association and Blackwell Publishing Ltd.en_US
dc.titleAuthoring Hierarchical Road Networksen_US
dc.description.seriesinformationComputer Graphics Forumen_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

  • 30-Issue 7
    Pacific Graphics 2011 - Special Issue

Show simple item record