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

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

Related Contents:

  1. Algorithm to detect intersection of two rectangles?
  2. Algorithm to fill triangle
  3. Precise subpixel line drawing algorithm (rasterization algorithm)
  4. Millions of 3D points: How to find the 10 of them closest to a given point?
  5. How to Compute OBB of Multiple Curves?
  6. I have an OpenGL Tessellated Sphere and I want to cut a cylindrical hole in it
  7. An algorithm to space out overlapping rectangles?
  8. Find if a point is inside a convex hull for a set of points without computing the hull itself
  9. Algorithm to return all combinations of k elements from n
  10. Why do we check up to the square root of a number to determine if the number is prime?
  11. Constant Amortized Time
  12. Counting inversions in an array
  13. What is stability in sorting algorithms and why is it important?
  14. Find largest rectangle containing only zeros in an N×N binary matrix
  15. Find a pair of elements from an array whose sum equals a given number
  16. Implement a queue in which push_rear(), pop_front() and get_min() are all constant time operations
  17. Difference between Big-O and Little-O Notation
  18. Diff Algorithm? [closed]
  19. Write a function that returns the longest palindrome in a given string
  20. How does finding a cycle start node in a cycle linked list work?
  21. Generate an integer that is not among four billion given ones
  22. How to get a square root for 32 bit input in one clock cycle only?
  23. Generating the partitions of a number
  24. Finding maximum for every window of size k in an array
  25. What algorithm for a tic-tac-toe game can I use to determine the “best move” for the AI?
  26. How can I compute a Cartesian product iteratively?
  27. Floating Point Divider Hardware Implementation Details
  28. Is there an efficient algorithm to generate a 2D concave hull?
  29. Best algorithm to test if a linked list has a cycle
  30. Efficient list intersection algorithm
  31. What algorithms compute directions from point A to point B on a map?
  32. What is the best way to get the minimum or maximum value from an Array of numbers?
  33. Argument for O(1) average-case complexity of heap insertion
  34. Two Rectangles intersection
  35. Find the missing and duplicate elements in an array in linear time and constant space
  36. O(nlogn) Algorithm – Find three evenly spaced ones within binary string
  37. Finding closest neighbour using optimized Levenshtein Algorithm
  38. reconstructing a tree from its preorder and postorder lists
  39. Algorithm to find two repeated numbers in an array, without sorting
  40. How to cartoon-ify an image programmatically?
  41. How to calculate or approximate the median of a list without storing the list
  42. Algorithm to list unique permutations of string with duplicate letters
  43. How do I check if a directed graph is acyclic?
  44. Basic Recursion, Check Balanced Parenthesis
  45. Time Complexity of two for loops [duplicate]
  46. The sieve of Eratosthenes in F#
  47. Iterating over a Binary Tree with O(1) Auxiliary Space
  48. Enumerating all paths in a directed acyclic graph
  49. Better shading on BW display while rendering filled surfaces
  50. Image Segmentation using Mean Shift explained

Leave a Comment