使用哪种算法来获取实心圆的点数?
int start_X = 30; // center point int start_Y = 30; int r = 5; // current point int x; int y; if(?==true) { map2D[x][y] = 1; // for filled circle points }
c++ geometry matrix
c++ ×1
geometry ×1
matrix ×1