BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//pretalx//talks.staging.osgeo.org//foss4g-2022//speaker//NMDFBE
BEGIN:VTIMEZONE
TZID:CET
BEGIN:STANDARD
DTSTART:20001029T040000
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:CET
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20000326T030000
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
TZNAME:CEST
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:pretalx-foss4g-2022-773JU8@talks.staging.osgeo.org
DTSTART;TZID=CET:20220826T120000
DTEND;TZID=CET:20220826T123000
DESCRIPTION:Connectivity of roads in a map is essential for many use cases 
 including navigation. We present a graph-based solution to the road confla
 tion problem which takes into account the connectivity of the road network
 . First\, we generate a road network graph in both sources based on bifurc
 ation points. Second\, we carry out node and edge matching between the gra
 phs where we follow shortest distance as a matching criterion. This is fol
 lowed by the merging stage where graph edges with matching end nodes get c
 onflated. Newly added roads are connected with the graph based on node and
  edge matching. We carry out experiments on conflating open source footway
  datasets from multiple cities with the OSM. The resulting conflated map c
 ontains up to 16x map feature improvements per city with geometrically acc
 urate and smooth results around road junctions. Future work involves using
  different graph matching criteria to improve on the conflated output.
DTSTAMP:20260403T222557Z
LOCATION:Modulo 0
SUMMARY:A Graph-Based Road Conflation Method Preserving Connectivity - Esra
  Cansizoglu\, Yunzhi Lin
URL:https://talks.staging.osgeo.org/foss4g-2022/talk/773JU8/
END:VEVENT
END:VCALENDAR