On Wed, Nov 11, 2009 at 11:17 PM, Apollinaris Schoell <[email protected]> wrote: > On Wed, Nov 11, 2009 at 7:19 PM, Anthony <[email protected]> wrote: >> It probably has to be a relation. Include a start node, an end node, >> and a list of one or more ways (which are connected to form one >> logical way). >> > the ways have to be split at the start/end node.
Not if you use a relation. > the relation members have to be ordered. No they don't. > how is that easier than the Karlsruhe scheme? It's not really easier so much as more correct. _______________________________________________ talk mailing list [email protected] http://lists.openstreetmap.org/listinfo/talk
