re looking for circle algorithm faster than bresenhams on wed apr gmt graeme labtam labtam oz au graeme gill said graeme yes that s known as bresenhams run length slice algorithm for graeme incremental lines see fundamental algorithms for computer graphics graeme springer verlag berlin heidelberg i have tried to extrapolate this to circles but i can t figure out how to determine the length of the slices any ideas graeme hmm i don t think i can help you with this but you might graeme take a look at the following graeme double step incremental generation of lines and circles graeme x wu and j g rokne computer graphics and image processing graeme vol no mar pp graeme double step generation of ellipses x wu and j g rokne graeme ieee computer graphics applications may pp another paper you might want to consider is article fungdraw title a run length slice line drawing algorithm without division operations author khun yee fung and tina m nicholl and a k dewdney journal computer graphics forum year volume number pages c c khun yee khun yee fung clipper csd uwo ca department of computer science middlesex college university of western ontario london ontario canada n a b tel fax
