-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Nic Roets schrieb: > * Change the A* heuristic from sqrt(sqr(dx)+sqr(dy)) to 1.1*sqrt(...) > or larger. This acknowledges that roads the shortest route between two > points is usually 10% longer than a straight route. And if you're > wrong the route may be slightly suboptimal, who cares.
Hello Nic, you are using the heuristic to find a total ordering. Why should a linear factor make any difference here? As far as I can see the ordering resulting would be completely identical. Would it break anything to even use sqr(dx)+sqr(dy) instead of sqrt(sqr(dx)+sqr(dy)) ? Marcus -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.6 (GNU/Linux) Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org iD8DBQFHQ1ZYf1hPnk3Z0cQRAjQDAKCD3khrVL+Xx3hJTIgNnHwwoWaApwCfX1dw beArQsSYvfK4iHnJ/mgWt0Y= =SFiA -----END PGP SIGNATURE----- _______________________________________________ Routing mailing list [email protected] http://lists.openstreetmap.org/cgi-bin/mailman/listinfo/routing
