{"title":"Automatic conflation of digital maps","authors":"Z. Deretsky, Uri Rdony","doi":"10.1109/VNIS.1993.585573","DOIUrl":null,"url":null,"abstract":"A consolidation method for combining geometrical and attribute data from two digital map sources, A and B, into one, ultimate map is described. This method is called \"conflation\" and its requires identification of the matching elements on both maps: vertices, arcs, and areas. Conflation generally consists of two parts (automatic and manual). The method is based on the usage of the chains of arcs in order to determine the matching intersections between them. The chains are formed a priori by using both attribute and geometric properties of the arcs. The intersections are treated as relations between chains and are stored in a simple external relational database.","PeriodicalId":185945,"journal":{"name":"Proceedings of VNIS '93 - Vehicle Navigation and Information Systems Conference","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of VNIS '93 - Vehicle Navigation and Information Systems Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/VNIS.1993.585573","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10
Abstract
A consolidation method for combining geometrical and attribute data from two digital map sources, A and B, into one, ultimate map is described. This method is called "conflation" and its requires identification of the matching elements on both maps: vertices, arcs, and areas. Conflation generally consists of two parts (automatic and manual). The method is based on the usage of the chains of arcs in order to determine the matching intersections between them. The chains are formed a priori by using both attribute and geometric properties of the arcs. The intersections are treated as relations between chains and are stored in a simple external relational database.