2 registered members (AndrewAMD, 7th_zorro),
1,285
guests, and 4
spiders. |
Key:
Admin,
Global Mod,
Mod
|
|
|
Finding parcels in a road network
#430877
10/04/13 09:23
10/04/13 09:23
|
Joined: Mar 2006
Posts: 1,993 Karlsruhe
PadMalcom
OP
Serious User
|
OP
Serious User
Joined: Mar 2006
Posts: 1,993
Karlsruhe
|
Hi, does anybody have an idea how I can determine the areas between the strees (marked red in the image)? What I have is the intersection coordinates of the streets and access to the road models and their vertices. What I want is a polygon that contains the shape of each area in between the streets. Any help or idea is highly appreciated!
|
|
|
Re: Finding parcels in a road network
[Re: PadMalcom]
#430887
10/04/13 11:45
10/04/13 11:45
|
Joined: Oct 2004
Posts: 900 Lgh
rojart
User
|
User
Joined: Oct 2004
Posts: 900
Lgh
|
@PadMalcom, I don't know what you exactly meant, but maybe region, like region_create is your choice.
|
|
|
Re: Finding parcels in a road network
[Re: PadMalcom]
#431340
10/14/13 13:22
10/14/13 13:22
|
Joined: Jun 2007
Posts: 1,337 Hiporope and its pain
txesmi
Serious User
|
Serious User
Joined: Jun 2007
Posts: 1,337
Hiporope and its pain
|
In the case you have the links of each vertex sorted clockwise or inverse, you can take a vertex, go to its neighbor and go to the next vertex by the next link until you reach the first vertex, closing the shape. If you create each link as a couple of links, one per direction starting from each vertex involved in the link, you can disable the links involved on the shape creation until you have no linked vertexes at all. It will definetively create a shape per zone, but it is a bit complicated... Hope it helps
|
|
|
Re: Finding parcels in a road network
[Re: txesmi]
#431364
10/15/13 09:20
10/15/13 09:20
|
Joined: Mar 2006
Posts: 1,993 Karlsruhe
PadMalcom
OP
Serious User
|
OP
Serious User
Joined: Mar 2006
Posts: 1,993
Karlsruhe
|
Hey txesmi, thanks for your answer but there are several problems with your approach. How do I find the neighbour? My roads consist of ~100 vertices. What if a shape is not closed? If you watch a voronoi diagramm it has ends that don't form a polygon. Furthermore, there can be more than 2 networks that are not connected. Again a special case that is not covered by your idea. But thanks anyway! I'm very glad you are thinking with me!
|
|
|
|