This is a lab project done under the course CS5016 Computational Methods and Applications. This project illustrates functionality of the Marching Sqaures Algorithm. This algorithm is used to approximate shapes and images, and find contour lines/bands. This algorithm is for 2D use-cases, but for 3D, we have Marching Cubes (with the same basic principle). Instead of Squares, we can have Triangles (called Triangle Meandering) or Tetrahedrons.
The basic principle of this algorithm is as follows:
Use Cases of these family of Algorithms:
Here are three different applications of the 2D algorithm.