{"title":"程序生成交通标志","authors":"F. Taal, Rafael Bidarra","doi":"10.2312/UDMV.20161415","DOIUrl":null,"url":null,"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.","PeriodicalId":161750,"journal":{"name":"Eurographics Workshop on Urban Data Modelling and Visualisation","volume":"68 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Procedural Generation of Traffic Signs\",\"authors\":\"F. Taal, Rafael Bidarra\",\"doi\":\"10.2312/UDMV.20161415\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":161750,\"journal\":{\"name\":\"Eurographics Workshop on Urban Data Modelling and Visualisation\",\"volume\":\"68 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-12-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Eurographics Workshop on Urban Data Modelling and Visualisation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2312/UDMV.20161415\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Eurographics Workshop on Urban Data Modelling and Visualisation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2312/UDMV.20161415","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
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.