Visualisation of 2D Vector fields using Bresenham's algorithms
Course Assignment for IS F311- Computer Graphics @ BITS Pilani, Hyderabad Campus.
- Implementing Bresenham's midpoint line and circle algorithm.
- To make a crude visualisation of vector fields made using Bresenham's lines and circles.
- To try out different samplings of the 2D space and record the results.
HTML documentation of the experiments
- The project is tested on Linux and built in C++ using the following libraries:
GL
GLUT
CMake
- To build :
g++ <main>.cpp -lGL -lglut -lGLU
- Run the output executable :
./a.out
- For non-linear input functions, the vector field takes time to render on the screen.
- For polynomial functions with higher degree the contraints need to be changed accordingly to render the output in lesser time.
- For sine and cosine functions the algorithm rounds values to integers -1,0,1.
- It may round the values of center and radius depending upon the function