Re: [svgwg] Bounding box algorithm is not precise

@BigBadaboom for strokes it is not the tight bounding box. For Masking, transform, fill and stroke and many other specs it has the very practical reason that graphic libraries provide different boxes for the stroke bounding box depending on their capabilities. For a keyword like `stroke-box` we need more predictability.
To compute those boxes w/o replicating the complexity and work a graphics library usually already does in an underlying-implementation independent manner is non-trivial and very performance consuming.
The mentioned algorithm is trivial and fast, returns the tight bounding box for basic shapes, otherwise a bounding box that guarantees that the stroke is inside the box and still the smallest rectangle based on heuristics (but not the tight bounding box).

-- 
GitHub Notification of comment by dirkschulze
Please view or discuss this issue at https://github.com/w3c/svgwg/issues/422#issuecomment-383545179 using your GitHub account

Received on Monday, 23 April 2018 11:37:52 UTC