**2**

# Calculate Vertices for Circle

###
#1
Members - Reputation: **140**

Posted 17 November 2012 - 01:41 PM

When drawing a circle on the screen using vector graphics, is there a way to calculate how many vertices should used given a specific radius, to make it appear smooth (pixel-level accuracy)? This will be less given a smaller radius, but it appears it's not directly proportional to the radius or circumference.

Thanks,

Matthew Rule

###
#2
Moderators - Reputation: **7905**

Posted 17 November 2012 - 01:58 PM

###
#4
Crossbones+ - Reputation: **8318**

Posted 18 November 2012 - 03:00 AM

Or maybe I'm misunderstanding the question...

**Edited by Bacterius, 18 November 2012 - 03:00 AM.**

The slowsort algorithm is a perfect illustration of the multiply and surrender paradigm, which is perhaps the single most important paradigm in the development of reluctant algorithms. The basic multiply and surrender strategy consists in replacing the problem at hand by two or more subproblems, each slightly simpler than the original, and continue multiplying subproblems and subsubproblems recursively in this fashion as long as possible. At some point the subproblems will all become so simple that their solution can no longer be postponed, and we will have to surrender. Experience shows that, in most cases, by the time this point is reached the total work will be substantially higher than what could have been wasted by a more direct approach.

- *Pessimal Algorithms and Simplexity Analysis*