You are to write a program that draws a border around a closed path into a bitmap, as displayed in the. The path is closed and runs along the grid lines, i.e. between the squares of the grid. The path runs. counter-clockwise, so if following the path is considered as going ” forward ” , the border pixels are always. to the ” right ” of the path. The bitmap always covers 32 by 32 squares and has its lower left corner at (0,0).You can safely assume that the path never touches the bounding rectangle of the bitmap and never. touches or crosses itself. Note that a bit gets set if it is on the outside of the area surrounded by the path. and if at least one of its edges belongs to the path, but not if only one of its corners is in the path. (A look. at the convex corners in the figure should clarify that statement.)
You are to write a program that draws a border around a closed path into a bitmap, as displayed in the following figure: The path is closed and runs along the grid lines, i.e. between the squares of the grid. The path runs counter-clockwise, so if following the path is considered as going ” forward ” , the border pixels are always to the ” right ” of the path. The bitmap always covers 32 by 32 squares and has its lower left corner at (0,0). You can safely assume that the path never touches the bounding rectangle of the bitmap and never touches or crosses itself. Note that a bit gets set if it is on the outside of the area surrounded by the path and if at least one of its edges belongs to the path, but not if only one of its corners is in the path. (A look at the convex corners in the figure should clarify that statement.)
