On Thu, Dec 2, 2010 at 2:51 AM, Sarah Hoffmann <lon...@denofr.de> wrote: > Hi Andrzej, > > On Wed, Dec 01, 2010 at 03:19:18PM +0100, andrzej zaborowski wrote: >> A further comment on splitting a big dataset into areas is that if the >> areas are disjoint (like in the case of countries, provinces and other >> administrative areas) or nearly disjoint (like in the case of their >> bboxes) you can build a sort of look-up tree from the list of bboxes, >> so that with n bboxes you only need a little more than log n "is this >> node inside?" checks. So for example if you're splitting the planet >> into 20000 areas, you only need about 15 tests for every node by doing >> a sort of bisection search. > > Do you know if there already exists an implementation that creates such > a look-up tree from the administrative boundaries in the OSM DB? >
No, Where is that code? Scott _______________________________________________ dev mailing list dev@openstreetmap.org http://lists.openstreetmap.org/listinfo/dev
