Paolo Cavallini ha scritto: > Markus Metz ha scritto: >> Could it be that the binary tree implementation in r.cost is not >> balanced? If yes, the search tree may degenerate on smooth surfaces >> towards a linked list, search time going from O(log n) to O(n). BTW, >> there are now three different generic balanced binary search tree >> implementations in the vector libs, plus sorted heaps. Just an idea. > > Tested on two different machines, (ubuntu+debian) 3 diff surfaces, > always the same result. It seems something more structural. > :( > But, is r.cost working for somebody else?
Further info: with very simple maps, everitying goes obviously fast, but it gets mangled after printing: Finding cost path Does this help? All the best. -- Paolo Cavallini: http://faunalia.it/pc _______________________________________________ grass-user mailing list [email protected] http://lists.osgeo.org/mailman/listinfo/grass-user
