Is the midpoint circle algorithm complete. I have recently been studying the circle and found some very interesting data. I never saw this algorithm before yesterday and I read it of course. It seemed to be lacking some very key points and was somewhat incomplete. I have been thinking of creating a new algorithm that has a somewhat different view on plots. Is this possible and are there any obstacles. This for instance is false in my algorithm theory

The "fast" direction here is the y direction. The algorithm always does a step in the positive y direction (upwards), and every now and then also has to do a step in the "slow" direction, the negative x direction.

You can reverse this.

Are you asking a question or stating an observation? I'm lost and unable to further help your situation.

I'm equally lost. Did you mean to post in another topic? Can you provide a URL to help us understand what you're talking about?

Actually I was stating an observation and asking a question. I tried to edit the post last night but I lost connect so I will clarify now. I have found many definitions for an algorithm. The thing is, I think it goes beyond a tutorial because it has code so it could be an algorithm, but maybe only from my veiw. I do not know how many circle and point formulas are in text to determine what you can do with a circle so I just do not know how to classify and yes KermMartian it could have been placed somewhere more suitable and of course code is not limited to the midpoint circle. I can draw and fill other shapes anywhere on the screen like stars for instance as well. Where do you think I should put this topic KermMartian.

Here are some mipoint circle algorithms that I took a look at. http://rooparam.blogspot.com/2009/09/midpoint-circle-algorithm.html
http://en.wikipedia.org/wiki/Midpoint_circle_algorithm

I have no idea what you're trying to say, but I'm moving this to the general programming forum.

Ohh, you're talking about what we generally call Bresenham's Algorithm or Bresenham's Circle Algorithm. Take a look at these for some further info:

Bresenham Fast Circle Algorithm: http://www.cemetech.net/forum/viewtopic.php?t=1251
C++ Bresenham's Line Algorithm: http://www.cemetech.net/forum/viewtopic.php?t=5401
Drawing a Solid Circle: http://www.cemetech.net/forum/viewtopic.php?t=5400

Each of those is an implementation of something Bresenham-y. Also, you can just call me Kerm.