-
|
Hello, i am currently employing the 2D Segment Delaunay Graph in my code. I want to use it with road networks, however, it is fairly unpredictable on how long the insertion of a large number of segments takes and it seems to be fairly sensitive to the order the segments are provided in (for insert_segments as well as when adding them one by one). @mkaravel do you now of an efficient way to inserting a large amount of segments stemming from a road network? In your paper you also spoke of random shuffling. Any help would be greatly appreciated! Thanks in advance! |
Beta Was this translation helpful? Give feedback.
Replies: 1 comment
-
|
Hello, You best use the function It first applies spatial_sort on the points and inserts just the points. |
Beta Was this translation helpful? Give feedback.
Hello,
You best use the function
insert_segments()It first applies spatial_sort on the points and inserts just the points.
And then it inserts the segments between the inserted points.