[PATCH 1/4] d2d1: Implement FillContainsPoint for rectangles

[Nikolay Sivov]

On Fri, Oct 21, 2016 at 7:28 PM, Andrew Eikum <aeikum at codeweavers.com>
wrote:

>
> +    *contains = probe.x > geometry->u.rectangle.rect.left - tolerance &&
> +            probe.x < geometry->u.rectangle.rect.right + tolerance &&
> +            probe.y > geometry->u.rectangle.rect.top - tolerance &&
> +            probe.y < geometry->u.rectangle.rect.bottom + tolerance;
> +
>

Does it really work like that? I'd expect tolerance to be irrelevant for
paths constructed purely from lines.
So basically in general case path is approximated with lines (or enclosed
area with triangles) with given tolerance,
and then point is tested against this flattened path. While in rectangular
case it's already flat to begin with.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.winehq.org/pipermail/wine-devel/attachments/20161021/f4bbc1c6/attachment.html>