Subversion Repositories gelsvn

		void shortest_edge_triangulate(Manifold& m)

		{

			int work;

			do

				{

					// For every face.

					work = 0;

					for(FaceIter fi =m.faces_begin(); fi != m.faces_end(); ++fi)

						{

							// Create a vector of vertices.

							vector<VertexIter> verts;

							for(FaceCirculator fc(fi); !fc.end(); ++fc)

								verts.push_back(fc.get_vertex());

							// If there are just three we are done.

							if(verts.size() == 3) continue;

							// Find vertex pairs that may be connected.

							vector<pair<int,int> > vpairs;

							const int N = verts.size();

							for(int i=0;i<N-2;++i)

								for(int j=i+2;j<N; ++j)

									if(!is_connected(verts[i], verts[j]))

										vpairs.push_back(pair<int,int>(i,j));

							if(vpairs.empty())

								{

									cout << "Warning: could not triangulate a face." 

											 << "Probably a vertex appears more than one time in other vertex's one-ring" << endl;

									continue;

								}

							/* For all vertex pairs, find the edge lengths. Combine the

								 vertices forming the shortest edge. */

							float min_len=FLT_MAX;

							int min_k = -1;

							for(size_t k=0;k<vpairs.size(); ++k)

								{

									int i = vpairs[k].first;

									int j = vpairs[k].second;

									float len = sqr_length(verts[i]->pos-verts[j]->pos);

									if(len<min_len)

										{

											min_len = len;

											min_k = k;

										}

								}

							assert(min_k != -1);

							{

								// Split faces along edge whose midpoint is closest to isovalue

								int i = vpairs[min_k].first;

								int j = vpairs[min_k].second;

								m.split_face(fi, verts[i], verts[j]);

							}

							++work;

						}

				}

			while(work);

		}