Hi @rakeshreddy0996,

If your roads can form areas (AreBuilder) you can then overlay the point PointOnAreOverlayer to get the points within the areas.

If not the the NeighborFinder with list option can provide you with point that are related to 2 or more lines within a certain distance.

Hi @rakeshreddy0996!

Does your dual carriageways have an ID or something that can group them together? In that case you should be able to join together all the segments and make a polygon out of each pair of carriageways and then you can do an overlay to find all points that are within such a polygon, i.e. between the dual carriageways.

Transformers to look into would be the AreaBuilder and the PointOnAreaOverlayer.

I'm too slow. Anyway, now you have two suggestions for the same solution. :-)

i have IDs but how to group together those could you please brief

anyway thanks

In the AreaBuilder you select your ID attribute in the box for "Group by". It will then consider each group of lines with the same ID as the only ones to create a polygon from, before going on to the next ID and group all those lines for the next polygon and so on.

The "Group by" function is fundamental to a lot of transformers, so check it out since it is a very useful piece of FME knowledge. :-)

no ID is same,

those single DualCarriage way with single side have individual ID

i can not possiable

Ok, and they haven't got an ID that says they are part of a pair? Like 10A and 10B, 11A and 11B and so on. If that's the case you can give them a temporary ID of 10, 11 and so on.

If not, you could still try the AreaBuilder with grouping on the attribute that says that these lines are part of a dual carriageway.

where list option is available in NeighborFinder in FME 2017

I would suggest reading the documentation....

@rakeshreddy0996

Hi.

If you don't have any form of relation for both parts of a dual carriage way then i think ou are left with 1 option.(You dont even have the dual carriage roads name?? Could have been used as a ID)

Relate by checking the geometric similarity.

One way to do it is to

Chopper 2 vertices all lines

Neighbourfinder to find closest.

Compare angle of candidate and base. (use a tolerance, for it is not likely to be exact in full decimals)

sorry i'm not understood bro

could you please brief.

Is there possible plz suggest process with transformation names.

1.take point buffer with some distance

2.that buffer Interaction with minimum two edges.

If you can provide some sample data that might help.

@rakeshreddy0996

Hi,

Like @itay said, could you upload a sample data-set so we can help you better? (and read up on the material..;))