I'm studying Computer Graphics at school. I've just got to know it, so plz help me solve this problem.
I used the algorithm Bresenham to draw line -> drew a star when we know its diameter. The request is that count the number of square bricks (c x c) to hem the star (use Bresenham algorithm). Could you help me plz ?

: I'm studying Computer Graphics at school. I've just got to know it,
: so plz help me solve this problem.
: I used the algorithm Bresenham to draw line -> drew a star when we
: know its diameter. The request is that count the number of square
: bricks (c x c) to hem the star (use Bresenham algorithm). Could you
: help me plz ?
:

One way would be fairly simple to implement.

1. Initialize an array to blank values maybe 0's.

2. Execute the draw on an array where each element of the array represents a pixel. Any pixel that is to be drawn by the algorithm is represented by a nonblank/nonzero value.

3. Loop through elements of the array and count how many were replaced by the drawing process.

The biggest problem you will have is if you are trying to optimize. This http://en.wikipedia.org/wiki/Bresenham's_line_algorithm is a fairly simple and straightforward implementation or pseudocode. If you know a programming language its quite easy to implement it.


: I'm studying Computer Graphics at school. I've just got to know it,
: so plz help me solve this problem.
: I used the algorithm Bresenham to draw line -> drew a star when we
: know its diameter. The request is that count the number of square
: bricks (c x c) to hem the star (use Bresenham algorithm). Could you
: help me plz ?
: