Skip to content

An implementation of the Marching Squares algorithm

License

Notifications You must be signed in to change notification settings

tmryan/MarchingSquares

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

10 Commits
 
 
 
 
 
 

Repository files navigation

MarchingSquares

Marching Squares is a 2D variation of the 3D Marching Cubes algorithm.

Marching Cubes was used as a means of creating a 3D mesh by sampling from a scan of some real world object using a tensor of cubes. As the cube edges are clipped, its vertices are tested to see whether they are encompassed by the shape. If so, then those cubes are set to some predetermined state which will approximate the given shape. More information and links to more info can be found on the Wikipedia Marching Cubes page.

For my implementation in 2D, I used ancient OpenGL (GLUT was required for the project) and C++. All of my source is included in the single cpp file for ease of submission.

About

An implementation of the Marching Squares algorithm

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages