Re: SVG2: wrong definition for bounding box algorithm

On Apr 18, 2014, at 11:15 PM, Bjoern Hoehrmann <derhoermi@gmx.net> wrote:

> * Dirk Schulze wrote:
>> The algorithm to compute a bounding box for a container states the following[1]:
>> 
>> 	• Let box be a rectangle initialized to (0, 0, 0, 0).
>> 
>> and later:
>> 
>> 	set box to be the union of box and the result of invoking the algorithm to compute a bounding box with child
>> 
>> That means that box will always include the point (0,0)
> 
> If `union` ignores that such a rectangle has no area then maybe, but
> that would be strange and unexpected, and I've certainly seen `union`
> implementations of geometry libraries that do not behave like that.
> Note that there is the related open issue "Issue 11: Need to define
> what the union of rectangles with no area means.”

Well, why wouldn’t

<path d=“M100,100L100,100z”/>

have a valid bounding box? You might not fill the area, but you can still stroke it or add a marker. So it is valid.

Greetings,
Dirk

> -- 
> Björn Höhrmann · mailto:bjoern@hoehrmann.de · http://bjoern.hoehrmann.de
> Am Badedeich 7 · Telefon: +49(0)160/4415681 · http://www.bjoernsworld.de
> 25899 Dagebüll · PGP Pub. KeyID: 0xA4357E78 · http://www.websitedev.de/ 

Received on Saturday, 19 April 2014 06:50:17 UTC