Hi,
marcus.wolsc...@googlemail.com wrote:
>> You need the route relation so you can represent easily both a local
>> and international route over the same ways, but it's no big deal if
>> you have to split the 420km international route into three sections.
>
> Do you have a wiki-page that defines
On Sun, 8 Feb 2009 22:24:47 +, Dave Stubbs
wrote:
> Umm.. yes. You've managed to get the complete wrong end of the stick :-)
> I was saying that's what relations are there for.
>
> You need the route relation so you can represent easily both a local
> and international route over the same way
Hi,
D Tucny wrote:
> IIRC, just splitting the ways in JOSM would result in the smaller ways all
> being members of the relation as the same object type as the original larger
> way by default... So, split the outer into two in JOSM and you automagically
> have two outer ways in the same relation..
2009/2/9 Frederik Ramm
> Hi,
>
> MP wrote:
> >> The advanced usage of the multipolygon relation allows you to have as
> many
> >> "outer" members as you want (see wiki page), so you can just split up
> your
> >> outer way and that's it. It probably isn't perfect in the renderers yet
> but
> >> I'
Richard Fairhurst wrote:
>
> Instead, try this:
>
> http://svn.openstreetmap.org/applications/utils/amf
>
> It's in Ruby - though I'm more a Perl hacker than a Ruby one, I had
> the Ruby AMF code written for Potlatch, so figured it would be easier
> to reuse this. You'll need to inst
Am Sun, 8 Feb 2009 14:28:29 +0100
schrieb MP :
>> a)
>> get Potlatch running
>
>when I tested it on another 32bit system, the reactions were very
>slow (perhaps I was in area with many ways with many nodes, but I was
>unable to even get potlatch to display something, no chance to
>actually edit. I
2009/2/8 MP :
>> Routes can happily be split -- the primary point of relations here is
>> to allow more than one route following the same way. It's not like
>> we're trying to build categories or similar -- we don't need to
>> because we can always match tags.
>
> Not always - there can be more rou
MP wrote:
> I tried it multiple times, with same result. The ordinary API
> seems to work, so I don't think it is just some server outage.
> Any clue where the problem may be?
Works fine for me, but just returns an empty list - i.e. there aren't any
deleted ways in that area. (The "get deleted w
On 8 Feb 2009, at 20:08, MP wrote:
>> Routes can happily be split -- the primary point of relations here is
>> to allow more than one route following the same way. It's not like
>> we're trying to build categories or similar -- we don't need to
>> because we can always match tags.
>
> Not always
Hi,
Dave Stubbs wrote:
> A relation with over 1000 members is a large object which will take
> large amounts of bandwidth and database power to download/upload even
> if you're not having to download every single member as well. Hence
> the limit.
D'oh, should have read that before writing the sa
Hi,
MP wrote:
>> The advanced usage of the multipolygon relation allows you to have as many
>> "outer" members as you want (see wiki page), so you can just split up your
>> outer way and that's it. It probably isn't perfect in the renderers yet but
>> I'm confident it will soon be.
>
> Automatic
Hi,
Ben Laenen wrote:
>> I'm pretty sure there will be, it is not implemented yet but I
>> believe we said it would be 1.000. Relations with more members become
>> very hard to work with.
>
> And why is that?
Because every time you make a change to an object, even if it is the
tiniest change, y
> Instead, try this:
>
> http://svn.openstreetmap.org/applications/utils/amf
I put in bbox=[48.6909603909255,13.88671875,48.80686346108517,14.150390625]
and run it, but it seem not to work - after while it aborts due to timeout:
./httpclient/timeout.rb:42:in `parse_header': execution expired
(
> Routes can happily be split -- the primary point of relations here is
> to allow more than one route following the same way. It's not like
> we're trying to build categories or similar -- we don't need to
> because we can always match tags.
Not always - there can be more routes on one road for
> And why is that? We cannot just split relations. I thought it was the
> whole purpose of relations to have everything together.
>
> So I guess you then propose something like a "super-relation". But
> that's not exactly user friendly: suppose I started tagging a 200 km
> long walking route from t
On Sun, Jan 4, 2009 at 3:57 PM, Gustav Foseid wrote:
> This is not intended to solve all problems with tagging of maritime
> borders, just as a temporary way to tag these borders without causing
> bubbles around all coastlines in all general purpose renderers.
Some more progess has been made on
2009/2/8 Maarten Deen :
> Frederik Ramm wrote:
>> Ben Laenen wrote:
>>> OK, as long as there's no limit on the number of relation members, I'm
>>> happy :-)
>>
>> I'm pretty sure there will be, it is not implemented yet but I believe
>> we said it would be 1.000. Relations with more members become
>> In Czech republic there are many forests that does not fit into the
>> new limit.
>
> Then you have even today created something that is very difficult for
> mappers to handle. The thought of downloading the history of one of these
> ways... shudder!
Those forest were imported approximately Aug
Frederik Ramm wrote:
> Ben Laenen wrote:
>> OK, as long as there's no limit on the number of relation members, I'm
>> happy :-)
>
> I'm pretty sure there will be, it is not implemented yet but I believe
> we said it would be 1.000. Relations with more members become very hard
> to work with.
S
On Sunday 08 February 2009, Frederik Ramm wrote:
> Hi,
>
> Ben Laenen wrote:
> > OK, as long as there's no limit on the number of relation members,
> > I'm happy :-)
>
> I'm pretty sure there will be, it is not implemented yet but I
> believe we said it would be 1.000. Relations with more members b
[Nabble appears to be going wappy, sorry for the previous half-sent
message]
MP wrote:
> I tried searching on CPAN for AMF classes, but I have
> found only server-side libraries for perl - I found code
> to create an AMF serice, but no code to call it. Do you
> know of any Perl package to c
MP wrote:
> I tried searching on CPAN for AMF classes, but I have
> found only server-side libraries for perl - I found code
> to create an AMF serice, but no code to call it. Do you
> know of any Perl package to call the AMF code?
>From a brief glance you should be able to use Data::AMF, but
Hi,
MP wrote:
> In Czech republic there are many forests that does not fit into the
> new limit.
Then you have even today created something that is very difficult for
mappers to handle. The thought of downloading the history of one of
these ways... shudder!
> Splitting them is not exactly eas
Hi,
Ben Laenen wrote:
> OK, as long as there's no limit on the number of relation members, I'm
> happy :-)
I'm pretty sure there will be, it is not implemented yet but I believe
we said it would be 1.000. Relations with more members become very hard
to work with.
Bye
Frederik
--
Frederik Ra
Lambertus wrote:
> The technical term for these surface infiltration beds used by local
> governments and industry (in the Netherlands) is 'wadi', referring to
> dry riverbeds like found in deserts. The Dutch section shows a few
> photographic examples that could apply in more temperate climates
In Czech republic there are many forests that does not fit into the
new limit. Splitting them is not exactly easy, as most of them are
multipolygons and you have to manually move inner parts between
multipolygon relations in JOSM (2000+ nodes forest usually have about
20-100 inner parts). Sometimes
On Sun, Feb 8, 2009 at 3:09 PM, Simon Ward wrote:
> On Sun, Feb 08, 2009 at 03:54:56PM +0100, Iván Sánchez Ortega wrote:
> > El Domingo, 8 de Febrero de 2009, Maarten Deen escribió:
> > > With one step 50% over the target.
> > > Apparently the API server has gotten scared that it is going to be
>
>> Hmmm but potlatch must have some way of querying for deleted
>> ways - if it is not the main API, is it something documented
>> somewhere? Some hidden API? Or should I try my luck with browsing
>> through potlatch sources or perhaps using wireshark to find out?
>
> Or you could ask me. :)
>
On Sun, Feb 08, 2009 at 03:54:56PM +0100, Iván Sánchez Ortega wrote:
> El Domingo, 8 de Febrero de 2009, Maarten Deen escribió:
> > With one step 50% over the target.
> > Apparently the API server has gotten scared that it is going to be
> > replaced. I can't get any data from it at all.
> > Has it
El Domingo, 8 de Febrero de 2009, Maarten Deen escribió:
> With one step 50% over the target.
> Apparently the API server has gotten scared that it is going to be
> replaced. I can't get any data from it at all.
> Has it gone in hiding in some closet somewhere? ;)
I think it must be queueing at th
BH wrote:
> Hmmm but potlatch must have some way of querying for deleted
> ways - if it is not the main API, is it something documented
> somewhere? Some hidden API? Or should I try my luck with browsing
> through potlatch sources or perhaps using wireshark to find out?
Or you could ask
On Thu, 05 Feb 2009 22:20:31 +
Grant Slater wrote:
> Frederik Ramm wrote:
> > Can we have a Munin graph for the amount of donations received ;-)
> >
>
> Best I can offer without sleep:
>
> http://donate.openstreetmap.org/raised.inc.html
> and
> http://donate.openstreetmap.org/comments/ (
Shaun McDonald wrote:
> On 8 Feb 2009, at 12:44, Ben Laenen wrote:
>
>> On Sunday 08 February 2009, Gary68 wrote:
>>> in europe there are 202 ways with more than 1950 nodes. complete
>>> lists can be found here:
>>> http://wiki.openstreetmap.org/wiki/SomeChecks
>>>
>>> or the europe file directly:
2009/2/7 Frederik Ramm :
> Liz,
>
>> OSM needs a protocol in which suspect material is reported in a particular
>> manner; contact is made with the mapper involved; a small time period is
>> given for reply; all suspect material removed until resolution.
>
> But in this case, as related by Albertas
On Sunday 08 February 2009, Shaun McDonald wrote:
> It will be a 2000 node limit. It is now quickly documented at
> http://wiki.openstreetmap.org/wiki/OSM_Protocol_Version_0.6#New_Limit
>s
OK, as long as there's no limit on the number of relation members, I'm
happy :-)
Ben
_
On 8 Feb 2009, at 12:44, Ben Laenen wrote:
> On Sunday 08 February 2009, Gary68 wrote:
>> in europe there are 202 ways with more than 1950 nodes. complete
>> lists can be found here:
>> http://wiki.openstreetmap.org/wiki/SomeChecks
>>
>> or the europe file directly:
>> http://www.gary68.de/osm/qa
> a)
> get Potlatch running
I tried once fiddling with Potlatch, but there were quite a lot of
problems geting flash to run on 64bit system and when I tested it on
another 32bit system, the reactions were very slow (perhaps I was in
area with many ways with many nodes, but I was unable to even get
Richard Fairhurst wrote:
> Etienne wrote:
>> We are going to keep the appeal open for at least a few more days.
>> We know there are more donations in the pipeline
>
> Google Inc
> Google Open Source Programs Office http://code.google.com/opensource/
> 2009-02-08 12:33:25
> GBP 5,000.00
>
> Wow.
http://lists.openstreetmap.org/pipermail/dev/2009-February/013847.html
On Sun, 2009-02-08 at 13:31 +0100, Gary68 wrote:
> in europe there are 202 ways with more than 1950 nodes. complete lists
> can be found here: http://wiki.openstreetmap.org/wiki/SomeChecks
>
> or the europe file directly:
>
Etienne wrote:
> We are going to keep the appeal open for at least a few more days.
> We know there are more donations in the pipeline
Google Inc
Google Open Source Programs Office http://code.google.com/opensource/
2009-02-08 12:33:25
GBP 5,000.00
Wow.
cheers
Richard
--
View this message in c
On Sun, Feb 8, 2009 at 1:31 PM, Gary68 wrote:
> in europe there are 202 ways with more than 1950 nodes. complete lists
> can be found here: http://wiki.openstreetmap.org/wiki/SomeChecks
>
> or the europe file directly:
> http://www.gary68.de/osm/qa/some/len_europe.htm
>
I did one for a big forest
On Sunday 08 February 2009, Gary68 wrote:
> in europe there are 202 ways with more than 1950 nodes. complete
> lists can be found here:
> http://wiki.openstreetmap.org/wiki/SomeChecks
>
> or the europe file directly:
> http://www.gary68.de/osm/qa/some/len_europe.htm
Does this suggest that there wi
in europe there are 202 ways with more than 1950 nodes. complete lists
can be found here: http://wiki.openstreetmap.org/wiki/SomeChecks
or the europe file directly:
http://www.gary68.de/osm/qa/some/len_europe.htm
btw: now i'll try the planet :-)
cheers
gary68
_
Hi,
the amenity=clock proposal is now open for voting. Please visit:
http://wiki.openstreetmap.org/index.php/Proposed_features/Clock
If you should decide to vote against it, it would be very helpful if
you include a small reason. Thanks.
Bye, Tim.
--
http://wikipedistik.de
___
Thank you to everyone who has donated to the hardware upgrade fund. We've
reached our target in under three days which is amazing.
We are going to keep the appeal open for at least a few more days. We know
there are more donations in the pipeline and there are still lots of people
who won't have
Hi,
malenki wrote:
> Retrieve lost data with planetosm-excerpt-tags.pl and
> planetosm-excerpt-area.pl parsing an older worldfile (or better partly
> file, if exist) containing the deleted items.
[...]
> Maybe there are other methods - I don't know them.
If you can find out the IDs of the "los
46 matches
Mail list logo
