Am 03.06.2018 um 11:27 schrieb clipka:

> The current algorithm implementing Binary Filling takes each edge
> (Xa,Ya)->(Xb,Yb), tests whether it intersects the ray
> (Xp,Yp)->(+inf,Yp), and keeps track of whether the number of
> intersecting edges is odd or even.
> 
> For example, this algorithm would be easy to adapt to Solid Filling, by
> just keeping track of whether the number of intersecting edges is non-zero.

Ha, that's of course nonsense, as it would leave everything "left" of
the polygon filled. Solid filling is far more difficult to implement
than binary filling, and I guess it can't be done without first
analyzing the topology of the polygon boundary.

Post a reply to this message