[OSM-dev] [OSM-talk] Circular relation by user mapper_07

[Chris Browet]

2009/7/16 Frederik Ramm <frederik at remote.org>

> Hi,
>
> Chris Browet wrote:
>
>> I'd be curious to know how the api calculates the bounding box of such a
>> relation
>>
>
>
> http://wiki.openstreetmap.org/wiki/OSM_Protocol_Version_0.6#Bounding_box_computation
>
>  assuming the api definition is "the smallest bbox containg all
>> children bbox'es".
>>
>
> It isn't.
>
>
Ok. If I understand well, it adds to a relation bbox all the nodes and ways
of children relations (+ the "pure" ways and nodes, of course).

That won't remove the problem of infinite recursion: R1 -> R2 -> R1; it will
add to R1 all ways/nodes of R2, which itself will add all ways/nodes of R1,
which will...

Bottomline question is: How does the api handle the case?

- Chris -
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.openstreetmap.org/pipermail/dev/attachments/20090716/be79bfce/attachment.html>