planeCutting.hpp 5.97 KB
Newer Older
Sylvain Thery's avatar
Sylvain Thery committed
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262
namespace CGoGN
{

namespace Algo
{

namespace Surface
{

namespace Modelisation
{

/*
template <typename PFP>
void planeCut(typename PFP::MAP& map, VertexAttribute<typename PFP::VEC3>& position, const Geom::Plane3D<typename PFP::REAL>& plane,
			  CellMarker<FACE>& cmf_over, bool keepTriangles=false, bool with_unsew = true)
{
	typedef typename PFP::REAL REAL;

	//marker for vertices on the plane
	CellMarker<VERTEX> cmv(map);

	// marker for vertices over the plane
	CellMarker<VERTEX> cmv_over(map);


	TraversorV<typename PFP::MAP> traVert(map);
	for (Dart d=traVert.begin(); d!=traVert.end();d=traVert.next())
	{
		Geom::Orientation3D or1 = plane.orient(position[d]);
		if (or1 == Geom::ON)
			cmv.mark(d);
		if (or1 == Geom::OVER)
			cmv_over.mark(d);
	}



	TraversorE<typename PFP::MAP> traEdg(map);
	for (Dart d=traEdg.begin(); d!=traEdg.end();d=traEdg.next())
	{
		Dart dd = map.phi1(d);


		if (!cmv.isMarked(d) && !cmv.isMarked(dd) && (cmv_over.isMarked(d) != cmv_over.isMarked(dd)))
		{
			Dart x = map.cutEdge(d);
			REAL dist1 = plane.distance(position[d]);
			REAL dist2 = plane.distance(position[dd]);

			if (dist1<0.0)
				dist1 = -dist1;
			if (dist2<0.0)			// no abs() to avoid type problem with REAL template
				dist2 = -dist2;

			position[x] = (position[d]*dist2 + position[dd]*dist1)/(dist1+dist2);

			traEdg.skip(x);
			traEdg.skip(map.phi_1(x));
			cmv.mark(x);
		}
	}

	Algo::Surface::Modelisation::EarTriangulation<PFP>* triangulator=NULL;
	if (keepTriangles)	// triangule faces if needed
	{
		triangulator = new Algo::Surface::Modelisation::EarTriangulation<PFP>(map);
	}

	TraversorF<typename PFP::MAP> traFac(map);
	for (Dart d=traFac.begin(); d!=traFac.end();d=traFac.next())
	{
		// turn in the face to search if there are 2 vertices marked as on the plane
		Traversor2FV<typename PFP::MAP> traV(map,d);
		Dart e=traV.begin();
		while ((e!=traV.end())&&(!cmv.isMarked(e)))
			e=traV.next();

		Dart V1=NIL;
		if (e!=traV.end())
			V1 = e;

		e=traV.next();
		while ((e!=traV.end())&&(!cmv.isMarked(e)))
			e=traV.next();

		Dart V2=NIL;
		if (e!=traV.end())
			V2 = e;

		// is there 2 vertices in the plane (but not consecutive)
		if ((V1!=NIL) && (V2!=NIL) && (V2!=map.phi1(V1)) && (V1!=map.phi1(V2)))
		{
			map.splitFace(V1,V2);
			if (with_unsew)
				map.unsewFaces(map.phi_1(V1)); // ne marche pas !

			// ensure to not scan this two new faces
			traFac.skip(V1);
			traFac.skip(V2);
			// mark face of V1 if it is over
			if (cmv_over.isMarked(map.phi1(V1)))
				cmf_over.mark(V1);
			// mark face of V2 if it is over
			if (cmv_over.isMarked(map.phi1(V2)))
				cmf_over.mark(V2);

			if (keepTriangles)	// triangule faces if needed
			{
				triangulator->trianguleFace(V1);
				triangulator->trianguleFace(V2);
			}
		}
		else
		{
			// find the first vertex not on the plane
			Dart e = d;
			while (cmv.isMarked(e))
				e = map.phi1(e);
			// face is all on same side than vertex
			if (cmv_over.isMarked(e))
				cmf_over.mark(e);
		}
	}

	if (triangulator != NULL)
		delete triangulator;
}
*/

template <typename PFP>
void planeCut(typename PFP::MAP& map, VertexAttribute<typename PFP::VEC3>& position, const Geom::Plane3D<typename PFP::REAL>& plane,
			  CellMarker<FACE>& cmf_over, bool keepTriangles=false, bool with_unsew = true)
{
	typedef typename PFP::REAL REAL;

	//marker for vertices on the plane
	CellMarker<VERTEX> cmv(map);
	// marker for vertices over the plane
	CellMarker<VERTEX> cmv_over(map);

	TraversorE<typename PFP::MAP> traEdg(map);
	for (Dart d=traEdg.begin(); d!=traEdg.end();d=traEdg.next())
	{
		Dart dd = map.phi1(d);

		REAL dist1;
		REAL dist2;

		Geom::Orientation3D or1 = plane.orient(position[d],dist1);
		Geom::Orientation3D or2 = plane.orient(position[dd],dist2);

		if (or1 == Geom::ON)
			cmv.mark(d);

		if (or2 == Geom::ON)
			cmv.mark(dd);

		if ((or1!=Geom::ON) && (or2!=Geom::ON) && (or1 != or2))
		{
			Dart x = map.cutEdge(d);

			if (dist1<0.0)
				dist1 = -dist1;
			if (dist2<0.0)			// no abs() to avoid type problem with REAL template
				dist2 = -dist2;

			position[x] = (position[d]*dist2 + position[dd]*dist1)/(dist1+dist2);

			traEdg.skip(x);
			traEdg.skip(map.phi_1(x));
			cmv.mark(x);

			if (or1 == Geom::OVER)
				cmv_over.mark(d);
			else
				cmv_over.mark(dd);
		}
		else
		{
			if (or1 == Geom::OVER)
			{
				cmv_over.mark(d);
				cmv_over.mark(dd);
			}
		}
	}

	Algo::Surface::Modelisation::EarTriangulation<PFP>* triangulator=NULL;
	if (keepTriangles)	// triangule faces if needed
	{
		triangulator = new Algo::Surface::Modelisation::EarTriangulation<PFP>(map);
	}

	TraversorF<typename PFP::MAP> traFac(map);
	for (Dart d=traFac.begin(); d!=traFac.end();d=traFac.next())
	{
		// turn in the face to search if there are 2 vertices marked as on the plane
		Traversor2FV<typename PFP::MAP> traV(map,d);
		Dart e=traV.begin();
		while ((e!=traV.end())&&(!cmv.isMarked(e)))
			e=traV.next();

		Dart V1=NIL;
		if (e!=traV.end())
			V1 = e;

		e=traV.next();
		while ((e!=traV.end())&&(!cmv.isMarked(e)))
			e=traV.next();

		Dart V2=NIL;
		if (e!=traV.end())
			V2 = e;

		// is there 2 vertices in the plane (but not consecutive)
		if ((V1!=NIL) && (V2!=NIL) && (V2!=map.phi1(V1)) && (V1!=map.phi1(V2)))
		{
			map.splitFace(V1,V2);
			if (with_unsew)
				map.unsewFaces(map.phi_1(V1)); // ne marche pas !

			// ensure to not scan this two new faces
			traFac.skip(V1);
			traFac.skip(V2);
			// mark face of V1 if it is over
			if (cmv_over.isMarked(map.phi1(V1)))
				cmf_over.mark(V1);
			// mark face of V2 if it is over
			if (cmv_over.isMarked(map.phi1(V2)))
				cmf_over.mark(V2);

			if (keepTriangles)	// triangule faces if needed
			{
				triangulator->trianguleFace(V1);
				triangulator->trianguleFace(V2);
			}
		}
		else
		{
			// find the first vertex not on the plane
			Dart e = d;
			while (cmv.isMarked(e))
				e = map.phi1(e);
			// face is all on same side than vertex
			if (cmv_over.isMarked(e))
				cmf_over.mark(e);
		}
	}

	if (triangulator != NULL)
		delete triangulator;
}


} // namespace Modelisation

} // namespace Surface

} // namespace Algo

} // namespace CGoGN