how do I create a line of arbitrary thickness using Bresenham?

by

Take another Bresenham loop and use it to modify the start and end position of original line in rectangular direction.
Problem is to efficently find the right starting point and not to draw any pixel twice (or skip a pixel) while drawing next line.

Working and tested C code is available from Github C code .

Here a test page including a few sample lines created by this code.
The black pixels are the starting points for the algorithm.

Test page with bresenham lines with different thickness

More Related Contents:

  1. Algorithm to detect intersection of two rectangles?
  2. Millions of 3D points: How to find the 10 of them closest to a given point?
  3. Algorithm to fill triangle
  4. Precise subpixel line drawing algorithm (rasterization algorithm)
  5. How to Compute OBB of Multiple Curves?
  6. Sort Four Points in Clockwise Order
  7. I have an OpenGL Tessellated Sphere and I want to cut a cylindrical hole in it
  8. An algorithm to space out overlapping rectangles?
  9. How do you find a point at a given perpendicular distance from a line?
  10. Find if a point is inside a convex hull for a set of points without computing the hull itself
  11. What Are High-Pass and Low-Pass Filters?
  12. Best algorithm for matching colours.
  13. Computing set intersection in linear time?
  14. Calculating mid in binary search
  15. Best word wrap algorithm? [closed]
  16. Finding closest neighbour using optimized Levenshtein Algorithm
  17. Best Compression algorithm for a sequence of integers
  18. Euler project #18 approach
  19. How to calculate the index (lexicographical order) when the combination is given
  20. What algorithm for a tic-tac-toe game can I use to determine the “best move” for the AI?
  21. K-means algorithm variation with equal cluster size
  22. What is the method for converting radians to degrees?
  23. Finding height in Binary Search Tree
  24. The best shortest path algorithm
  25. Algorithm for permutations of operators and operands
  26. Find local minimum in n x n matrix in O(n) time
  27. Why is bubble sort O(n^2)?
  28. Location of highest density on a sphere
  29. Why is the “start small” algorithm for branch displacement not optimal?
  30. What is the difference between Linear search and Binary search?

Leave a Comment