George Rassovsky
Cubical Marching Squares Implementation
Thesis Cubical Marching Squares Implementation
Abstract
Extracting a polygonal mesh from an existing scalar field has been a discussed topic over many years in the Computer Graphics field. Many algorithms have been developed which perform the task to a satisfac- tory level. But only a few claim to solve all known existing problems. However, due to greater complexitytheir usage never become widespread. One such algorithm is the Cubical Marching Squares (CMS) Ho et al. (2005), which claims to solve nearly all issues which other algorithms face. Now, a decade after its conception, any further research on it is scarce, and there are hardly any implementations. This thesis verifies its plausibility by developing an isosurface extraction library loosely based on a partial implementation of the CMS algorithm.
Some results:
