CompuServe Messages

Jeff, I'd be most happy to look at your code. Your 320×200 calculations sound like they'd work rather well. Yeah, I do the 256X+64X=320X trick myself, it's much faster than doing the multiply. I haven't worked on poly routines yet, though I do know in theory how they should work. Actually, you only have to project the poly turnpoints on the screen, right? From there on it's just Bresenham lines and fill algorithms, do you agree? Well, we could try to use the Wu line algorithms, they're supposed to be quite a bit faster than Bresenham's, but I have never actually coded up a Wu line algorithm. So what do you mean by studying the database? You mean the method you use for storing the polygon turnpoints? You know, it's occurred to me that you could build ANYTHING out of triangles, so it may be better to work on an engine thet ONLY draws fast triangles. Or maybe also fast squares. I just wonder if it would be faster than arbitrary-number-of-points polygons? I guess it depends on what you want. If you want to do the "intersecting shapes" trick, then I guess triangles would be tougher to make look right. Just a thought, what do you think? Regards, Fred Trafton