#computer-graphics
Read more stories on Hashnode
Articles with this tag
The Sutherland–Hodgman algorithm is an algorithm used for clipping polygons. · The Sutherland–Hodgman algorithm is an algorithm used for clipping...
Polygon rendering is a fundamental technique in computer graphics used to represent three-dimensional objects in a two-dimensional space. · Polygon...
Hill climbing algorithm is a local search algorithm which continuously moves in the direction of increasing value to find the best solution. · In the...
One of the most efficient and easiest to drive of the circle algorithms is due to Bresenham. · It is not easy to display a continuous smooth arc on the...
The mid-point circle drawing algorithm is an algorithm used to determine the points needed for rasterizing a circle. · The mid-point circle drawing...
Z-Buffer Algorithm or Depth Buffer Algorithm is an image space method for hidden surface detection. · Please note that this algorithm can be daunting and...
