Challenge
Given an integer radius \$r \geq 0\$, write a program that prints each set of cartesian coordinates in a counter-clockwise spiral originating at \$(0, 0)\$ as shown here (for \$r = 3\$), with indices:
Input
The program should take \$r\$, a non-negative integer, as an input. The input is assumed to be valid and in the range \$2^{32} \geq r \geq 0\$.
Output
The output of the program should be a comma-space-delimited list of integer coordinates in a counter-clockwise circle, starting with \$(0, 0)\$ out to a radius of \$r\$.
Test Cases
r = 0 -> No output
r = 1 ->
(0, 0)
r = 3 (shown in diagram) ->
(0, 0), (1, 0), (1, 1), (0, 1), (-1, 1), (-1, 0), (-1, -1), (0, -1), (1, -1), (2, -1), (2, 0), (2, 1), (2, 2), (1, 2), (0, 2), (-1, 2), (-2, 2), (-2, 1), (-2, 0), (-2 -1), (-2, 0), (-2, -1), (-2, -2), (-1, -2), (0, -2), (1, -2), (2, -2)
This is code-golf, so the shortest answer in bytes, per language, wins.
