-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Lester Caine wrote: > Mark Williams wrote: >> -----BEGIN PGP SIGNED MESSAGE----- >> Hash: SHA1 >> >> Lester Caine wrote: >>> J.D. Schmidt wrote: >>>> Lester Caine skrev: >> [big snip] >> >>> LOGICALLY - there should never have been a problem created. A POI element >>> should consist of a single entity which may have additional area >>> information. >>> Even those tags that are currently only defined as 'node' in many cases >>> WILL >>> be expanded to include area information at some point. So PLEASE can we >>> have >>> some sensible method of identifying PAIRS of tags so we can THEN decide >>> what >>> to do with them !!! >>> >> Is this not a job for relations? If the pair were related, then we have >> no problem? > > Correct - but how do you identify elements uniquely so you can create the > relation? > I would assume a) manually or b) As per the prior discussion on generating the Mapnik duplicate points & eliminating clashes, by algorithm.
Manually would give better data, but I have a lot of parking marked up by me - and it seems I'm not alone :) - so perhaps (b) should be done as a one-off, after a consensus has been gained? A bit of manual clean-up after a mass conversion would be OK, and as it's a relation it's not adding new nodes where there's only an area, nor vice-versa, and it lets any interested renderers do it properly. It wouldn't do anything nasty with the underlying data that I can see. I see I'm not the only one to suggest it... Mark -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.7 (GNU/Linux) Comment: Using GnuPG with Mandriva - http://enigmail.mozdev.org iD8DBQFHxFnRJfMmcSPNh94RAishAJ0VwGm2EDqng66Za1mRhnxgQ9XfWQCffjJC 6Bhf5s99t7wqYo0/QStvw2I= =1r0F -----END PGP SIGNATURE----- _______________________________________________ talk mailing list [email protected] http://lists.openstreetmap.org/cgi-bin/mailman/listinfo/talk
