Roy Wallace <[email protected]> wrote: > So the routing software has to approximate the target node with some > other node that *is* connected... and if the router does this > approximation sub-optimally, this is a problem with the router, right?
How can it possibly know? This is garbage in, garbage out. When asked an impossible question, the answer is gibberish. The router has no way of knowing that the node is connected to two nearby ways rather than just the nearest, which is the approximation I'd expect. Service roads seem like the perfect solution: They're unabiguous and exactly correct. Trying to drive or route to disconnected nodes is nonsensical. -- Sam Couter | mailto:[email protected] OpenPGP fingerprint: A46B 9BB5 3148 7BEA 1F05 5BD5 8530 03AE DE89 C75C
signature.asc
Description: Digital signature
_______________________________________________ Talk-au mailing list [email protected] http://lists.openstreetmap.org/listinfo/talk-au
