Marching cubes algorithm (DirectX10)

A test of implementing the marching cubes algorithm in C++ using DirectX10. The generation of geometry is currently done on the CPU, but it's still pretty fast. The geometry in the video is generated from a 100x100x100 volume matrix.

Based mainly on the article written by Paul Bourke:
http://local.wasp.uwa.edu.au/~pbourke/geometry/polygonise/
The example written by Rui Madeira was also a great aid:
http://www.vimeo.com/3873744

http://en.wikipedia.org/wiki/Marching_cubes is also good. ;)

Category:

Science & Technology

Tags:

• Marching cubes
• isosurface
• directx 10
• polygonize
• scalar field
• optimized
• game
• 3d
• voxel
• solid 3d
• geometry
• add
• subtract
• mesh
• dynamic
• destructible terrain
• bytegrove
• zzz

[zapakitul]

Awesome work Zzz. Do you have any reference for this algorithm? I'd love to try and implement this.

[bytegrove]

@zapakitul

Sure! I've added them to the video description now.

[zapakitul]

@bytegrove thankx man

[Robinerd]

here's the source code:

int PWN(int kickass, int awesome)

{  int EPIC = kickass + awesome; return EPIC;

}