re looking for circle algorithm faster than bresenhams in article apr nwnexus wa com mpdillon halcyon com michael dillon writes i have an algorithm similar to bresenhams line drawing algorithm that draws a line by stepping along the minor axis and drawing slices like aaaa bbbb cccc in the following diagram aaaa bbbb cccc yes that s known as bresenhams run length slice algorithm for incremental lines see fundamental algorithms for computer graphics 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 hmm i don t think i can help you with this but you might take a look at the following double step incremental generation of lines and circles x wu and j g rokne computer graphics and image processing vol no mar pp double step generation of ellipses x wu and j g rokne ieee computer graphics applications may pp graeme gill
