Hi, > To routing: I have no clue > how it's done at the moment, but doing routing from a standard databse > should never be fast, instead a special routing data set could be > created.
Yes, but if creating that data set would mean finding any intersection between ways and then trying to find out whether this is a topological intersection (where you can change from one way onto the other) or not, that would take ages. (If you're interested in taking this further, there's an osm-routing list.) Bye Frederik -- Frederik Ramm ## eMail [EMAIL PROTECTED] ## N49°00.09' E008°23.33' _______________________________________________ dev mailing list [email protected] http://lists.openstreetmap.org/cgi-bin/mailman/listinfo/dev
