Marching squares algorithm
CS-116B: Computer Graphics Algorithms
Instructor: Robert Bruce
Spring 2017

SLIDE 1: Metaball and Blobby Algorithms

  • Marching squares:
    - Approximating perimeter of 2D blobby surfaces through area sampling.

SLIDE 2: 2D Blobs: comprised of circles

Screenshot of circles. The circles represent arbitrary blobs.

Screenshot derived from source: http://jamie-wong.com/2014/08/19/metaballs-and-marching-squares/

SLIDE 3: 2D Blobs: comprised of circles

Screenshot of circles on a square grid. The squares are effectively sampling the circles.

Screenshot derived from source: http://jamie-wong.com/2014/08/19/metaballs-and-marching-squares/

SLIDE 4: 2D Blobs: decrease square size

Screenshot derived from source: http://jamie-wong.com/2014/08/19/metaballs-and-marching-squares/

SLIDE 5: Sample with squares

Screenshot derived from source: http://jamie-wong.com/2014/08/19/metaballs-and-marching-squares/

SLIDE 6: Marching squares: 16 cases

Source: http://jamie-wong.com/2014/08/19/metaballs-and-marching-squares/

SLIDE 7: Marching squares: 16 cases

Screenshot derived from source: http://jamie-wong.com/2014/08/19/metaballs-and-marching-squares/

SLIDE 8: The Blob approximated

Screenshot derived from source: http://jamie-wong.com/2014/08/19/metaballs-and-marching-squares/

SLIDE 9: For Further Reading