CGAL users discussion list

[Josip Dzolonga <>]

Dear All,

I'm trying to implement a simple region growing algorithm. However, I am experiencing some problems. The code follows, a highlighted version can be found at http://pastie.org/672455

std::list<Facet> * S = new std::list<Facet>;
	while(!triList.empty()) {
		std::cout << "!\n";
		Facet best = (triList.top()).triangle;
		triList.pop();
		S->push_back(best);
		// Find the neighboring cell and then get the facets
		Cell_handle cell = best.first;
		int indexInCell = best.second;
		// Now, the indices of the other vertices of the tetrahedron are computed
		int v1 = (indexInCell+1)%4;
		int v2 = (indexInCell+2)%4;
		int v3 = (indexInCell+3)%4;
		Edge e1(cell, v1, v2);
		Edge e2(cell, v2, v3);
		Edge e3(cell, v1, v3);
		// Now, the neighbors
		std::set<Facet> neighbours;

		Facet_circulator c,d;

		c = d = T.incident_facets(e1);
		int i=0;

		do {
			std::cout << "*";
			Facet current = *c;

			if(find(S->begin(), S->end(), current) == S->end() &&
				!T.is_infinite(current)) {
				triList.push(HeapPair(current, 0));
			}

			if(i++ == 3) break;
		} while(++c != d);
	}

The problem is that the while(++c != d) loop will never end. Also, please point out to me if the algorithm logic is completely incorrect.

Thank you in advance,

Josip