Re[2]: [Gnash-dev] Re: point test

[Udo Giacomozzi]

Hello Sandro,

Sunday, November 4, 2007, 11:54:26 PM, you wrote:
SS> Two examples in which your algorithm would fail:

SS>          E2 -->
SS>     +---------------+              Q : query point
SS>  ^  |               |             E5 : nearest edge, no fill
SS>  |  |       +       | E3      E1..E4 : edges with right fill
SS>  E1 |    E5 | Q     | |
SS>     |       +       | V
SS>     +---------------+
SS>         <--  E4


This is not a valid example because E5 would need to have both fill
sides set.


SS>          E2 -->
SS>     +---------------+              Q : query point
SS>     |               |   
SS>     |               |   
SS>  ^  |   <-E5        |             E5 : nearest edge, left fill (hole)
SS>  |  |  +----+       | E3      E1..E4 : edges with right fill
SS>  E1 |  |    | Q     | |
SS>     |  +----+       | V
SS>     +---------------+
SS>         <--  E4

E5 would have it's right side fill style set and thus we get the
correct result (that Q is in the filled area).


SS> Note that both examples are valid topologies.

Don't agree, the first one is not correct AFAIK. A single path does
not have to be closed, but a complete shape must be closed by
definition, if I'm not wrong. If you place a edge inside a filled
area, it has to contain fill style information.


Udo