Hi all ,
I am writing a tool to detect all unconnected nodes in a
street network within a small range , for ex: 3 meters?
I tried to solve it by making buffers around all nodes in
all streets � Excluding Intersected streets � and then checking whether
there are streets that lie within the drawn buffers or not? If yes, then an
unconnected node is detected, if no, then � therein- that specified street
is truly connected, and so on among all streets in the network.
However, this algorithm didn�t work properly, because during
the first phase of checking the points of intersection; different
coordinates were detected for intersected nodes which I�m 100% sure both of
streets have the same coordinates! ( I used snap nodes to be sure from that)
Any suggestion will be greatly appreciated.
Thank you
Ami
_______________________________________________________________________
List hosting provided by Directions Magazine | www.directionsmag.com |
To unsubscribe, send e-mail to [EMAIL PROTECTED] and
put "unsubscribe MapInfo-L" in the message body.
