Hola, On Wed, 2 May 2001, Professor Dredd wrote: > I would think that whether your plotting lines, > shapes, mathmatical functions you'd use the same algo > to calc the address and bit to change. No, not really. For example, when drawing a line you either move one pixel sideways or vertically, which means it's much faster to update the bitmap address instead of recalculate it. Negative coordinates allow more flexibility in algorithms, or to put it another way some algorithms generate negative coordinates. For example, drawing a circle of radius 50 at the point (20,20), or drawing a 3D object that has one vertex off the visible screen. Without negative coordinates, a routine can be streamlined. My only point is that it's useless to talk about the fastest way to plot a pixel until the routine is put in context. Otherwise, the fastest routine _I_ know of to plot a pixel is: LDA #$10 STA $8000 Six cycles. -S - This message was sent through the cbm-hackers mailing list. To unsubscribe: echo unsubscribe | mail cbm-hackers-request@dot.tml.hut.fi.
Archive generated by hypermail 2.1.1.