CPC G06F 16/29 (2019.01) [G06F 16/9024 (2019.01); G06F 18/213 (2023.01); G06F 18/231 (2023.01); G06F 18/24 (2023.01)] | 13 Claims |
1. A method comprising:
receiving a plurality of linear feature detections, wherein the plurality of linear features detections represents one or more linear features of a geographic environment that are detected using at least one sensor;
designating a linear feature detection pair comprising two of the plurality of linear feature detections;
performing a classification of the linear feature detection pair as a must-link pair or a cannot-link pair, wherein the classification is based on satisfying a predetermined intersecting length as a total length of a first linear feature of a first linear feature detection of the two of the plurality of linear feature detections within a predetermined area corresponding to a second linear feature of a second linear feature detection of the two of the plurality of linear feature detections, wherein the classification of the cannot-link pair is based on one or more linear feature detection pairs that should not be grouped together;
clustering the plurality of linear feature detections into at least one cluster, wherein the clustering of the plurality of linear feature detections is based on the classification;
determining that the at least one cluster forms a polygon;
cutting the polygon at one or more cut locations to form a plurality of sub-clusters of the plurality of linear feature detections;
extracting respective centerlines for the plurality of sub-clusters;
connecting the respective centerlines at the one or more cut locations to generate a network graph of the one or more linear features; and
providing the network graph as an output for generating and storing digital map data in a geographic database.
|