marching_cubes.h

// Modified from Paul Bourke, Polygonising a Scalar Field
// Additional ource code by Shawn Halayka
// Source code is in the public domain


#ifndef MARCHING_CUBES_H
#define MARCHING_CUBES_H


#include "primitives.h"
#include <vector>
using namespace std;


namespace marching_cubes
{
	class grid_cube
	{
	public:

		grid_cube(void)
		{
			value[0] = 0.0f;
			value[1] = 0.0f;
			value[2] = 0.0f;
			value[3] = 0.0f;
			value[4] = 0.0f;
			value[5] = 0.0f;
			value[6] = 0.0f;
			value[7] = 0.0f;
		}

		vertex_3 vertex[8];
		float value[8];
	};

	vertex_3 vertex_interp(const float isovalue, vertex_3 p1, vertex_3 p2, float valp1, float valp2);
	short unsigned int tesselate_grid_cube(const float isovalue, const grid_cube &grid, triangle *const triangles);
	void tesselate_adjacent_xy_slice_pair(const vector<float> &xyplane0, const vector<float> &xyplane1, const size_t z, vector<triangle> &triangles, const float isovalue, const float x_grid_min, const float x_grid_max, const size_t x_res, const float y_grid_min, const float y_grid_max, const size_t y_res, const float z_grid_min, const float z_grid_max, const size_t z_res);
};

#endif