Implementation Algorithms Isosurface

1 implementation algorithms

1.1 marching cubes
1.2 asymptotic decider
1.3 marching tetrahedrons
1.4 surface nets
1.5 dual contouring

implementation algorithms
marching cubes

the marching cubes algorithm first published in 1987 siggraph proceedings lorensen , cline, , creates surface intersecting edges of data volume grid volume contour. surface intersects edge algorithm creates vertex. using table of different triangles depending on different patterns of edge intersections algorithm can create surface. algorithm has solutions implementation both on cpu , on gpu.

asymptotic decider

the asymptotic decider algorithm developed extension marching cubes in order resolve possibility of ambiguity in it,

marching tetrahedrons

the marching tetrahedrons algorithm developed extension marching cubes in order solve ambiguity in algorithm , create higher quality output surface.

surface nets

the surface nets algorithm places intersecting vertex in middle of volume voxel instead of @ edges, leading smoother output surface.

dual contouring

the dual contouring algorithm first published in 2002 siggraph proceedings ju , losasso, developed extension both surface nets , marching cubes. retains vertex @ center of voxel adds surface generation leverages octrees add support geometry adapts number of triangles in output complexity of surface.