How do I find the neighbour? My roads consist of ~100 vertices.
I mean that the neighbors to be computed are the crossroads. The roads are created from crossroad to crossroad as links, aren't they? So the points on the shape are crossroads. The segments between points need to follow the road path that connects them, straight or curved, it is not important.
What if a shape is not closed? If you watch a voronoi diagramm it has ends that don't form a polygon.
The shape surrounds deadends and
always closes itself. Look at this picture:
The only problem is to identify witch shape is the outside, but not really a problem: it is the largest one.
Furthermore, there can be more than 2 networks that are not connected. Again a special case that is not covered by your idea.
In the moment you have the outside shapes of more than one net, they need to be considered as inside shapes of a global outern shape.
But thanks anyway! I'm very glad you are thinking with me!
Happy to help... if that helps
