Procedural Generation of Traffic Signs
dc.contributor.author | Taal, Fieke C. | en_US |
dc.contributor.author | Bidarra, Rafael | en_US |
dc.contributor.editor | Vincent Tourre and Filip Biljecki | en_US |
dc.date.accessioned | 2016-12-07T17:24:00Z | |
dc.date.available | 2016-12-07T17:24:00Z | |
dc.date.issued | 2016 | |
dc.description.abstract | Procedurally-generated virtual urban worlds typically miss plausible signaling objects on the road network, unless they were manually inserted. We present a solution to the problem of procedurally populating a given urban road network with plausible traffic signs. Our tagged graph approach analyzes the road network using a rule-based reasoning mechanism that represents relevant traffic rules, in order to identify potential sign locations. Eventually, a context-based reduction step helps choose the most suitable candidates, taking into account a variety of real-world rules, and determines their actual place and orientation. We discuss the performance and validation of our approach, and conclude that its generality and flexibility make it a very convenient extension to many procedural urban environment applications. | en_US |
dc.description.sectionheaders | Modelling | |
dc.description.seriesinformation | Eurographics Workshop on Urban Data Modelling and Visualisation | |
dc.identifier.doi | 10.2312/udmv.20161415 | |
dc.identifier.isbn | 978-3-03868-013-0 | |
dc.identifier.issn | 2307-8251 | |
dc.identifier.pages | 17-23 | |
dc.identifier.uri | https://doi.org/10.2312/udmv.20161415 | |
dc.identifier.uri | https://diglib.eg.org:443/handle/10.2312/udmv20161415 | |
dc.publisher | The Eurographics Association | en_US |
dc.subject | [Computing methodologies] | |
dc.subject | Computer graphics | |
dc.subject | Shape modeling [Computing methodologies] | |
dc.subject | Artificial intelligence | |
dc.subject | Knowledge representation and reasoning | |
dc.title | Procedural Generation of Traffic Signs | en_US |
Files
Original bundle
1 - 1 of 1