i have been looking for a way to find all main roads intersections in a given region. The code below works but it is terribly inefficient. Can You please propose a more efficient solution?
node(52.2319237,20.9967265,52.2379237,21.0167265); way(bn) [highway~"motorway|trunk|primary|secondary|tertiary"]->.allways; (.allways; .allways >
->.waynodes; foreach.allways->.theway( (.theway; .theway >)->.thewaynodes; (.allways; - .theway)->.allways; foreach.allways->.refway( (.refway; .refway >)->.refwaynodes; node.refwaynodes.thewaynodes->.common; .common out; ); );
أكثر...
node(52.2319237,20.9967265,52.2379237,21.0167265); way(bn) [highway~"motorway|trunk|primary|secondary|tertiary"]->.allways; (.allways; .allways >
->.waynodes; foreach.allways->.theway( (.theway; .theway >)->.thewaynodes; (.allways; - .theway)->.allways; foreach.allways->.refway( (.refway; .refway >)->.refwaynodes; node.refwaynodes.thewaynodes->.common; .common out; ); ); أكثر...