[Tagging] How to solve the problem with relation overload?

2012-11-30 Thread Martin Vonwald
Hi! I'm a little desperate now. The increasing number of relations - especially those for public transport - make it harder and harder to make simple edits. Example: http://www.openstreetmap.org/browse/way/146170815 I avoid to edit the "Süd Autobahn" because I'm aware that it is nearly impossibl

Re: [Tagging] How to solve the problem with relation overload?

2012-11-30 Thread Richard Mann
Try using Potlatch On Fri, Nov 30, 2012 at 9:59 AM, Martin Vonwald wrote: > Hi! > > I'm a little desperate now. The increasing number of relations - > especially those for public transport - make it harder and harder to > make simple edits. > > Example: http://www.openstreetmap.org/browse/way/14

Re: [Tagging] How to solve the problem with relation overload?

2012-11-30 Thread Pieren
On Fri, Nov 30, 2012 at 10:59 AM, Martin Vonwald wrote: > Are we sure that those relations provide more information than they > prevent to be provided? In the example you are pointing, 6 of the 9 relations are for the Bus 311. I never map public transport relations but I've seen its modeling exp

Re: [Tagging] How to solve the problem with relation overload?

2012-11-30 Thread Philip Barnes
Does anyone else find that editing ways with relations slows potlatch to a crawl? I find that there is a long delay when ever I do anything to them? Phil -- Sent from my Nokia N9 On 30/11/2012 10:02 Richard Mann wrote: Try using Potlatch On Fri, Nov 30, 2012 at 9:59 AM, Martin Vonwald wr

Re: [Tagging] How to solve the problem with relation overload?

2012-11-30 Thread Jo
2012/11/30 Pieren > On Fri, Nov 30, 2012 at 10:59 AM, Martin Vonwald > wrote: > > > Are we sure that those relations provide more information than they > > prevent to be provided? > > In the example you are pointing, 6 of the 9 relations are for the Bus > 311. I never map public transport relati

Re: [Tagging] How to solve the problem with relation overload?

2012-11-30 Thread Martin Koppenhoefer
2012/11/30 Pieren : > In the example you are pointing, 6 of the 9 relations are for the Bus > 311. I never map public transport relations but I've seen its modeling > expanding very far in complexity in recent time (fault is also because > some routes are complexe anyway). The amount of route relat

Re: [Tagging] How to solve the problem with relation overload?

2012-11-30 Thread Pieren
On Fri, Nov 30, 2012 at 11:41 AM, Martin Koppenhoefer wrote: > not a good idea IMHO, as it makes editing far more complex (you will > have to understand from just a collection of nodes which ways are > effectively part of a route relation). Not necessarily. Creating routes will be more or less t

Re: [Tagging] How to solve the problem with relation overload?

2012-11-30 Thread Ilpo Järvinen
On Fri, 30 Nov 2012, Martin Koppenhoefer wrote: > 2012/11/30 Pieren : > > In the example you are pointing, 6 of the 9 relations are for the Bus > > 311. I never map public transport relations but I've seen its modeling > > expanding very far in complexity in recent time (fault is also because > >

Re: [Tagging] How to solve the problem with relation overload?

2012-11-30 Thread Richard Fairhurst
Philip Barnes wrote: > Does anyone else find that editing ways with relations > slows potlatch to a crawl? I find that there is a long > delay when ever I do anything to them? It shouidn't do (and hasn't done on any system I've seen), but I did see a trac ticket that reported something similar.

Re: [Tagging] How to solve the problem with relation overload?

2012-11-30 Thread Martin Koppenhoefer
2012/11/30 Pieren : > On Fri, Nov 30, 2012 at 11:41 AM, Martin Koppenhoefer > wrote: >>> [only nodes for routes] >> not a good idea IMHO, as it makes editing far more complex (you will >> have to understand from just a collection of nodes which ways are >> effectively part of a route relation). >

Re: [Tagging] How to solve the problem with relation overload?

2012-11-30 Thread Henning Scholland
Am 30.11.2012 11:57, schrieb Pieren: On Fri, Nov 30, 2012 at 11:41 AM, Martin Koppenhoefer wrote: not a good idea IMHO, as it makes editing far more complex (you will have to understand from just a collection of nodes which ways are effectively part of a route relation). Not necessarily. Crea

Re: [Tagging] How to solve the problem with relation overload?

2012-11-30 Thread Richard Welty
i'm going to ask a question that occurred to me the other day. why model the ways a bus route takes? why not just have an ordered list of the stops it makes? what data consumers need to know the ways a bus takes? richard ___ Tagging mailing list Tagg

Re: [Tagging] How to solve the problem with relation overload?

2012-11-30 Thread Henning Scholland
Am 30.11.2012 14:37, schrieb Richard Welty: i'm going to ask a question that occurred to me the other day. why model the ways a bus route takes? why not just have an ordered list of the stops it makes? what data consumers need to know the ways a bus takes? Hmm...maybe they wants to display it in

Re: [Tagging] How to solve the problem with relation overload?

2012-11-30 Thread Martin Koppenhoefer
2012/11/30 Richard Welty : > i'm going to ask a question that occurred to me the other day. > > why model the ways a bus route takes? why not just have an ordered > list of the stops it makes? what data consumers need to know the ways > a bus takes? There are lots of interesting applications, for

Re: [Tagging] How to solve the problem with relation overload?

2012-11-30 Thread Pieren
On Fri, Nov 30, 2012 at 2:21 PM, Henning Scholland wrote: > Eg.: > ___D___ >/ \ >| | > ---A---C---B I'm not sure to understand your problems here. If your route goes through A->D then select A and D. If your route is A->C->D, then select A, C & D. The only possible (th

Re: [Tagging] How to solve the problem with relation overload?

2012-11-30 Thread Henning Scholland
Am 30.11.2012 15:11, schrieb Pieren: On Fri, Nov 30, 2012 at 2:21 PM, Henning Scholland wrote: Eg.: ___D___ / \ | | ---A---C---B Think about there is only -A-D-B- , where A and B are a node in such a relation. Everything is fine. Now someone adds a way A-C-B. This

Re: [Tagging] How to solve the problem with relation overload?

2012-11-30 Thread Jaakko Helleranta.com
+1 This was exactly what I was about to comment. I'd add that things might look relatively ok in areas where the map data is pretty complete -- but it totally tanks in areas where it's not. I didn't come to think of the access-/practicability-related, which make it even more complicated. As per

Re: [Tagging] How to solve the problem with relation overload?

2012-11-30 Thread Jaakko Helleranta.com
"why not just have an ordered list of the stops it makes?" Eg. Because public transportation systems don't always have fixed stops. + the other reasons mentioned. -Jaakko --Original Message-- From: Richard Welty To: tagging@openstreetmap.org ReplyTo: Tag discussion, strategy and related

Re: [Tagging] How to solve the problem with relation overload?

2012-11-30 Thread Pieren
On Fri, Nov 30, 2012 at 3:31 PM, Henning Scholland wrote: > Think about there is only -A-D-B- , where A and B are a node in such a > relation. Everything is fine. Still not sure to understand what is specific to a route modeling with waypoints instead of segment list. In your example, A and B ar

[Tagging] SEGMENT

2012-11-30 Thread A.Pirard.Papou
Hi, The more I tag, the more I read these lists, the more I think: If we could use SEGMENT... I'll just sketch the idea. It has several implications to be discussed. So, I refrained from making an incorrect or incomplete proposition, but an /in construction/ one would be fine. The best idea is

Re: [Tagging] How to solve the problem with relation overload?

2012-11-30 Thread Henning Scholland
See picture ( http://www.aighes.de/data/routes.png ). Hope it makes it more clear. Green points are your route-nodes, black lines are given OSM-ways (which would actually in route-relation), red line is the route, blue line is an added OSM-way or an OSM-way which changes access-Tags. If a ma

[Tagging] Fwd: Door to door routing to buildings with multiple occupants

2012-11-30 Thread Rob Nickerson
-- Forwarding message from talk as more appropriate to tagging list -- Hi, A mapper who is new to my area is interested in mapping disabled access at a micro level. Specifically he would like to achieve door-to-door mapping for key shops and amenities, and has made a good start by

Re: [Tagging] How to solve the problem with relation overload?

2012-11-30 Thread Tobias Knerr
On 30.11.2012 11:29, Pieren wrote: > Or find > another modeling for routes (e.g. with intersection nodes only). That would actually be my preferred solution: Add the stops, and just enough nodes along the route to make it robust to calculate. It would require solid tool support, though. The curre