Screening lines of non-unit thickness?

Question

Algorithms

Please advise where to look. I read Chirikov's manual on graphics, and then a question arose by itself that went beyond the scope of the things described there.

Answer 1

Have you watched Bresenham's algorithm yet?

Answer 2

I would draw a center line with a Bresenham, and from it I would fill vertically (if the line is longer in x than in y) or horizontally (otherwise) a number of pixels equal to the length of the vertical/horizontal axis section of the thick line. This approach has problems at the ends of the segment (but there, in any case, you have to think about what to do). And the accuracy is not very high.

Answer 3

Since there are no special details in the question, I will offer a couple of ready-made solutions www.crossgl.com/aggpas/ and graphics32.org/wiki//Main/Graphics32