Re: Fill algorithm - pointers?
Colin Taylor wrote:
> (Jiri's poly routine only fills vertically convex polygons (!?) )
False. It really depends, which version of vgraph you have. Early
versions had just the general, unrestricted routines, later versions
had both, and just the last one or two had vertically convex one only,
because it is somewhat faster. (Colin should know better, I gave him
both! ;))
And Jeff, you do not have to 'fake' the filled ellipse, it's in my
vgraph too. It is almost as fast as the built-in routine and it does
plain fills as well as fancy 2d patterns. I am not quite sure about
the vgraph version in the Archives, it might be safer to fetch it off
my page - that should be almost up to date. I am offering it only
because I know how difficult it can be to get the ellipse algorithm in
the form Euphoria uses, an ellipse defined by the containing
rectangle. The published ones all seem to be for ellipses defined by
their centre and both half-axes, which are slightly inferior.
Eventually I had to derive it all myself...
Best of luck, and if you need any help, give me a yell. jiri
|
Not Categorized, Please Help
|
|
