The current algorithm used to fill a disk checks for every point within a square if it belongs to the disk.
This is slow because it requires several float multiplications for each point.
One way to improve the algorithm is to determine a quarter (or even an eighth) of the circle and then filling the disk with lines using symmetry
An efficient way to determine this border is still required
The current algorithm used to fill a disk checks for every point within a square if it belongs to the disk. This is slow because it requires several float multiplications for each point.
One way to improve the algorithm is to determine a quarter (or even an eighth) of the circle and then filling the disk with lines using symmetry An efficient way to determine this border is still required