src/cdtGen.cpp
/*! \fn void CDTGenerator::formMissingSegmentsQueue(vector<DartHandle> &missingSegmentQueue)
    \brief Collects missing constraint segments in a queue

    Determines which constraint segments are missing from Delaunay tetrahedralization of vertices of PLC.

    \param missingSegmentQueue [Out] Contains the _DartHandle_ to the missing constraint segments after execution.
*/
\fn void CDTGenerator::formMissingSegmentsQueue(vector &missingSegmentQueue)
\brief Collects missing constraint segments in a queue

Determines which constraint segments are missing from Delaunay tetrahedralization of vertices of PLC.

\param missingSegmentQueue [Out] Contains the _DartHandle_ to the missing constraint segments after execution.
\ fn void CDTGenerator :: formMissingSegmentsQueue ( vector &missingSegmentQueue ) \ brief Collects missing constraint segments in a queue Determines which constraint segments are missing from Delaunay tetrahedralization of vertices of PLC . \ param missingSegmentQueue [ Out ] Contains the _DartHandle_ to the missing constraint segments after execution .
void CDTGenerator::formMissingSegmentsQueue()
{
	missingSegmentQueue.clear();
	for (LCC::One_dart_per_cell_range<1>::iterator segmentIter = plc.one_dart_per_cell<1>().begin(), segmentIterEnd = plc.one_dart_per_cell<1>().end(); segmentIter != segmentIterEnd; segmentIter++)
	{
		CGALPoint p1 = plc.point(segmentIter);
		CGALPoint p2 = plc.point(plc.beta(segmentIter, 1));
		CellHandle c;
		int i, j;
		VertexHandle vh1, vh2;
		if (DT.is_vertex(p1, vh1))
			if (DT.is_vertex(p2, vh2))
				if (!DT.is_edge(vh1, vh2, c, i, j))
					missingSegmentQueue.push_back(segmentIter);
	}
	return;
}
void CDTGenerator :: formMissingSegmentsQueue ( ) { missingSegmentQueue . clear ( ) ; for ( LCC :: One_dart_per_cell_range < 1 > :: iterator segmentIter = plc . one_dart_per_cell < 1 > ( ) . begin ( ) , segmentIterEnd = plc . one_dart_per_cell < 1 > ( ) . end ( ) ; segmentIter != segmentIterEnd ; segmentIter ++ ) { CGALPoint p1 = plc . point ( segmentIter ) ; CGALPoint p2 = plc . point ( plc . beta ( segmentIter , 1 ) ) ; CellHandle c ; int i , j ; VertexHandle vh1 , vh2 ; if ( DT . is_vertex ( p1 , vh1 ) ) if ( DT . is_vertex ( p2 , vh2 ) ) if ( ! DT . is_edge ( vh1 , vh2 , c , i , j ) ) missingSegmentQueue . push_back ( segmentIter ) ; } return ; }
\fn void CDTGenerator::formMissingSegmentsQueue(vector<DartHandle> &missingSegmentQueue)
\brief Collects missing constraint segments in a queue
\ fn void CDTGenerator :: formMissingSegmentsQueue ( vector<DartHandle > &missingSegmentQueue ) \ brief Collects missing constraint segments in a queue
//	cout << "\nTotal number of missing constraint segments:" << missingSegmentQueue.size() << endl;