In article <[email protected]> [email protected] writes: >I'd be curious to know how the api calculates the bounding box of such a >relation, assuming the api definition is "the smallest bbox containg all >children bbox'es".
Trapi handles this by keeping a hash of all the relations that have been seen processing this relation already. (It also does relation members first, creating a hash of way members to process.) There are some relations that are in a huge number of tiles. -- Blars Blarson [email protected] With Microsoft, failure is not an option. It is a standard feature. _______________________________________________ dev mailing list [email protected] http://lists.openstreetmap.org/listinfo/dev
