1. Fill algorithm - pointers?
I'm working on the Linux/libvga version of graphics.e, and I need
a fill algorithm for the polygon procedure. I can 'fake' one for
the ellipse procedure, but if I get an entirely general one, so
much the better. Pointers, please?
--
Jeff Zeitlin
jzeitlin at cyburban.com
2. Re: Fill algorithm - pointers?
Jeff Zeitlin wrote:
> Fill algorithm - pointers?
I believe that Jiri had written one in "pure" Euphoria. If you can't find
it, I can probably dig up a routine I had written some time back.
-- David Cuny
3. Re: Fill algorithm - pointers?
Jeff,
If it will help, I have a virtual polygon routine which graphically
duplicates the built-in Eu routine. (Jiri's poly routine only fills
vertically convex polygons (!?) )
Colin Taylor
David Cuny wrote:
>
> Jeff Zeitlin wrote:
>
> > Fill algorithm - pointers?
>
> I believe that Jiri had written one in "pure" Euphoria. If you can't find
> it, I can probably dig up a routine I had written some time back.
4. Re: Fill algorithm - pointers?
- Posted by jiri babor <jbabor at PARADISE.NET.NZ>
Mar 02, 2000
-
Last edited Mar 03, 2000
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
5. Re: Fill algorithm - pointers?
On Thu, 2 Mar 2000 00:00:19 -0500, Colin Taylor
<ctaylor at ACCESS.INET.CO.TH> wrote:
>If it will help, I have a virtual polygon routine which graphically
>duplicates the built-in Eu routine. (Jiri's poly routine only fills
>vertically convex polygons (!?) )
This is what I would be looking for, and I would appreciate a
copy. From your comment about Jiri's routine, I suspect that it
could handle an hourglass, but not an hourglass on its side (if
that clears your confusion any). Or maybe vice-versa.
--
Jeff Zeitlin
jzeitlin at cyburban.com
