Below I will provide you with some English fragments. You need to summarize the main points of the fragments, list the main points in points (for example, the first point is..., the second point is.....):after the Delaunay triangulation network is built, whenever a connecting segment is inputted,
e.g., (p1, p5) in Figure 8, instead of adding (p1, p5) to the road network directly, a shortest path
between p1 and p5 is searched in the Delaunay network and regarded as a real road segment, which is
(p1, p2, p3, p4, p5) in this example. With this step, the various long length connecting segments
are divided into multiple sequentially connected segments. The shortest path can be found with
classical Dijkstra’s algorithm [22]. For the directed graph without negative weight, this is the fastest
single-source-shortest-path algorithm known at present.
However, using the length of the Delaunay edge directly as the weight of Dijkstra’s algorithm
will lead to the interpolation result at the curve not meeting expectations. As depicted in Figure 9,
the red line segment in the figure is weighted by the length of the Delaunay edge, the Dijkstra algorithm
is used to search for the shortest path from p4 to p7 and p7 to p9. Obviously, due to the neglect of
p5 and p8, the resulting shape does not match the shape of the actual road. Generally, in the road
generation process, we prefer multiple short lines to a direct long line