actually, I believe that an algorithm like the contraction hierarchies could be a perfect candidate for a mobile device. Indeed its great strength is to visit very few nodes and thus it might work to have the whole graph on a memory card and not loading it in memory. Obviously the preprocessing must be done on a desktop computer.
Of course it will require some heavy adaption on the graph structure... On Sun, Jul 11, 2010 at 11:18 AM, Marcus Wolschon <[email protected]> wrote: > -----BEGIN PGP SIGNED MESSAGE----- > Hash: SHA1 > > Am 11.07.2010 11:12, schrieb Danny Backx: >> On Sat, 2010-07-10 at 09:06 +0200, Dennis Luxen wrote: >>>> Thanks for publishing it. The algorithm is standart >>>> contraction hierarchies, isn't it ? >>> >>> It is a variant that utilizes all available cores during >>> preprocessing. >> >> Probably a stupid question. How feasible is it to run this >> algorithm on a mobile device ? > > - From what I reat, not at all. > The old memory vs. request-computing-time vs. precomputation-time > tradeoff. > > Marcus > -----BEGIN PGP SIGNATURE----- > Version: GnuPG v1.4.9 (GNU/Linux) > Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org/ > > iEYEARECAAYFAkw5jEsACgkQf1hPnk3Z0cTe2wCg1WdibafGlsU5St1CX80J1eUr > m1EAoKrmiNk5C6qRgazw1qkcAzQcxyPR > =HuSS > -----END PGP SIGNATURE----- > > > _______________________________________________ > Routing mailing list > [email protected] > http://lists.openstreetmap.org/listinfo/routing > _______________________________________________ Routing mailing list [email protected] http://lists.openstreetmap.org/listinfo/routing
