Okay, so I just built my own system with a pgNewArray, I'm not infatuated
with it, but it works well enough to continue work on polygon filling.
Anyway, I couldn't find a polygon algorithm that I thought was good for our
particular case. So I came up with a descend from top trapezoid/triangle
horizontal fill algorithm. Presently the trapezoid and triangular fill with
dual simultaneous bresenham midpoint calcs works. I need to get the
recursion for drawing "left over" traps and tris next. Should be done
tomorrow. (Gonna get some sleep now) Micahs' bresenham was well done :),
have to love cut & paste & modify.
Thanks,
Shane Nay.
On Friday 01 June 2001 15:35, Shane Nay wrote:
> Micah,
> I'm working on a couple more graphic primitives. Namely Polygons, filled
> Polygons, Arcs, and filled Arcs. My plan was to do Arcs first, but in
> order to to do the filled ones I think the most efficient way is to finish
> filled Polygons first.
>
> Now, that brings up a problem, in that, all our present drawing primitives
> have fixed amounts of data attached to them, except for the bitmap drawers.
> So I don't know what the approach that Micah wants to take here (it is
> Micah's descision in my opinion), so do we take a multiple arg tact (...),
> or do we take a copying of stuff into binary store like the bitmap? (This
> is for Polygons, Arcs have a fixed number of arguments)
>
> Thanks,
> Shane Nay.
>
> _______________________________________________
> Pgui-devel mailing list
> [EMAIL PROTECTED]
> http://lists.sourceforge.net/lists/listinfo/pgui-devel
_______________________________________________
Pgui-devel mailing list
[EMAIL PROTECTED]
http://lists.sourceforge.net/lists/listinfo/pgui-devel
