Hello, After some thoughts, I think that what I would need, is only the current xml files, where there is a constraint that each way may be only made of nodes of degree 2 (except at start and end). Of course I guess that there is no way to change the API ;)
Wouldn't be it easy to make that as the exchange format, e.g. by adding a Link property made of nodes ? Of course this would break the normal form as it would be redundant to ways. A universal binary format with some API would be nice for people that want to play with graph algorithms (like students) but I personnaly have no use for that (yet). On Thu, Oct 16, 2008 at 8:30 AM, Philip Homburg <[EMAIL PROTECTED]> wrote: > In your letter dated Wed, 15 Oct 2008 23:45:46 +0200 you wrote: >>Marcus Wolschon wrote: >>> I think it would be better to discuss basic >>> storage and indexes first before going on >>> about special optimizations. >>> >>I agree with that. >>Is there some lowest common denominator for a generalized routing format? >>Something everyone could use / need who works on routing osm data? >>There is a nice visual description by Michael Josenhans in the wiki >>http://wiki.openstreetmap.org/index.php/OSM_Routing_Data_Layer >>As a first step merge the intermediate nodes of degree two? >>Is this simple enough to fit everyone? > > One thing worth considering for routing (not for displaying a moving map) > is the use of a line graph (http://en.wikipedia.org/wiki/Line_graph). > That should make it possible to represent turn restrictions directly in the > graph. And it also provides easy support for different costs of crossing > an intersection (a left turn compared to a right turn). > > > > _______________________________________________ > Routing mailing list > [email protected] > http://lists.openstreetmap.org/listinfo/routing > _______________________________________________ Routing mailing list [email protected] http://lists.openstreetmap.org/listinfo/routing
