J
Julia
Hi, there,
My task is:
There is a network of intersected lines, e.g., a road network. What I
have is a list of lines, and each item in the list includes the
coordinates of points on each line.
I need an algorithm to trace the whole network, find the intersections
of all the lines, and record the lengths between two different
intersections or between an intersection and an endpoint of a line. Can
you help me out to design an efficient algorithm to do this? Any
suggestaions on the algorithms and data structures would be highly
appreciated. If you could write it in pseudo-code, that would be even
better.
Thanks a lot,
JJ
My task is:
There is a network of intersected lines, e.g., a road network. What I
have is a list of lines, and each item in the list includes the
coordinates of points on each line.
I need an algorithm to trace the whole network, find the intersections
of all the lines, and record the lengths between two different
intersections or between an intersection and an endpoint of a line. Can
you help me out to design an efficient algorithm to do this? Any
suggestaions on the algorithms and data structures would be highly
appreciated. If you could write it in pseudo-code, that would be even
better.
Thanks a lot,
JJ