marching_square Struct Reference

#include <marching_cube.hpp>

List of all members.

Public Member Functions

• marching_square (void)
• ~marching_square (void)

Static Public Member Functions

• template<class Mesh , class POINTS , class VALUES , class C > static bool polygonize (Mesh &res, const POINTS &points, const VALUES &values, const C &lvl)

---

Detailed Description

Definition at line 30 of file marching_cube.hpp.

---

Constructor & Destructor Documentation

marching_square

(

void

)

[inline]

Definition at line 34 of file marching_cube.hpp.

{};

~marching_square

(

void

)

[inline]

Definition at line 35 of file marching_cube.hpp.

{};

---

Member Function Documentation

bool polygonize	(	Mesh &	res,
		const POINTS &	points,
		const VALUES &	values,
		const C &	lvl
	)			[inline, static]

Definition at line 43 of file marching_cube.hpp.

References Edge, mmx::shape::mc_interpolate(), and Point.

Referenced by polygonizer< C, default_2d, Input, Output >::run().

                                                                                       {

    typedef typename Mesh::Point       Point;
    typedef typename Mesh::Edge        Edge;

    Point pt[4];

    int nrPoint=0;

    if(val[0]>lvl)
    {
        if(val[1]<=lvl)
        {
            mc_interpolate(pt[nrPoint++], P[0], P[1], val[0], val[1], lvl);
        }

        if(val[3]<=lvl)
        {
            mc_interpolate(pt[nrPoint++], P[0], P[3], val[0], val[3], lvl);
        }
    }

    if(val[1]>lvl)
    {
        if(val[0]<=lvl)
        {
            mc_interpolate(pt[nrPoint++],  P[1], P[0], val[1], val[0], lvl);
        }

        if(val[2]<=lvl)
        {
            mc_interpolate(pt[nrPoint++],  P[1], P[2], val[1], val[2], lvl);
        }
    }


    if(val[2]>lvl)
    {
        if(val[1]<=lvl)
        {
            mc_interpolate(pt[nrPoint++],  P[2], P[1], val[2], val[1], lvl);
        }

        if(val[3]<=lvl)
        {
            mc_interpolate(pt[nrPoint++],  P[2], P[3], val[2], val[3],lvl);
        }
    }

    if(val[3]>lvl)
    {
        if(val[2]<=lvl)
        {
            mc_interpolate(pt[nrPoint++],  P[3], P[2], val[3], val[2], lvl);
        }

        if(val[0]<=lvl)
        {
            mc_interpolate(pt[nrPoint++],  P[3], P[0], val[3], val[0], lvl);
        }
    }

    Point* p1, *p2;
    for (int i=0;i < nrPoint;i+=2) {
        p1 = new Point(pt[i]);
        res.insert_vertex(p1);
        p1->set_index(res.vertices().size()-1);
        p2 = new Point(pt[i+1]);
        res.insert_vertex(p2);
        p2->set_index(res.vertices().size()-1);
        Edge* e= new Edge(p1, p2);
        res.insert_edge(e);
    }
    return true;
}

---

The documentation for this struct was generated from the following file:

• include/shape/marching_cube.hpp