Re: [Gnash-dev] Re: point test

[Bastiaan Jacques]

On Sun, 4 Nov 2007, Udo Giacomozzi wrote:
> A hit_test() algorithm should not be hard to implement at all. The
> most difficult part is probably handling of the quadratic bezier
> curves, but with some math one should find the right formula for
> these.

A bezier resolving implementation is already in render_handler_ogl.cpp
(which is derived from curve() in tesselate.cpp).

> BTW, what is the problem with the current implementation?

The current implementation does not take into account that a shape may
be defined by several paths. Instead, it calls point_test() on every
single path in the shape definition. This leads to results that are
sometimes wrong.

Bastiaan