src/cdtGen.cpp
/*! \fn bool CDTGenerator::isVertexAcute(DartHandle inputPointHandle)
    \brief Tests whether input vertex is acute

    A vertex is _not_ acute if there exists _atleast_ one pair of _incident_ segments which have angle _greater_ than 90 degrees.    
    \param [in] inputPointHandle DartHandle of input vertex
*/


A vertex is _not_ acute if there exists _atleast_ one pair of _incident_ segments which have angle _greater_ than 90 degrees.
\param [in] inputPointHandle DartHandle of input vertex
A vertex is _not_ acute if there exists _atleast_ one pair of _incident_ segments which have angle _greater_ than 90 degrees . \ param [ in ] inputPointHandle DartHandle of input vertex
bool CDTGenerator::isVertexAcute(DartHandle inputPointHandle)
{
	vector<DartHandle> incidentOnInputPoint;
	for (LCC::One_dart_per_incident_cell_range<1, 0>::iterator incidentSegmentIter = plc.one_dart_per_incident_cell<1, 0>(inputPointHandle).begin(), incidentSegmentIterEnd = plc.one_dart_per_incident_cell<1, 0>(inputPointHandle).end(); incidentSegmentIter != incidentSegmentIterEnd;incidentSegmentIter++)
		incidentOnInputPoint.push_back(incidentSegmentIter);
	for (vector<DartHandle>::iterator segIter1 = incidentOnInputPoint.begin(); segIter1 != incidentOnInputPoint.end(); segIter1++) 
		for (vector<DartHandle>::iterator segIter2 = incidentOnInputPoint.begin(); segIter2 != incidentOnInputPoint.end(); segIter2++)
		{
			if (*segIter1 != *segIter2)
			{
				if (dotProduct(*segIter1, *segIter2) > 0.0 )
					return true;
			}
			else
				continue;
		}
	return false; 
}
bool CDTGenerator :: isVertexAcute ( DartHandle inputPointHandle ) { vector < DartHandle > incidentOnInputPoint ; for ( LCC :: One_dart_per_incident_cell_range < 1 , 0 > :: iterator incidentSegmentIter = plc . one_dart_per_incident_cell < 1 , 0 > ( inputPointHandle ) . begin ( ) , incidentSegmentIterEnd = plc . one_dart_per_incident_cell < 1 , 0 > ( inputPointHandle ) . end ( ) ; incidentSegmentIter != incidentSegmentIterEnd ; incidentSegmentIter ++ ) incidentOnInputPoint . push_back ( incidentSegmentIter ) ; for ( vector < DartHandle > :: iterator segIter1 = incidentOnInputPoint . begin ( ) ; segIter1 != incidentOnInputPoint . end ( ) ; segIter1 ++ ) for ( vector < DartHandle > :: iterator segIter2 = incidentOnInputPoint . begin ( ) ; segIter2 != incidentOnInputPoint . end ( ) ; segIter2 ++ ) { if ( * segIter1 != * segIter2 ) { if ( dotProduct ( * segIter1 , * segIter2 ) > 0.0 ) return true ; } else continue ; } return false ; }
\fn bool CDTGenerator::isVertexAcute(DartHandle inputPointHandle)
\brief Tests whether input vertex is acute
\ fn bool CDTGenerator :: isVertexAcute ( DartHandle inputPointHandle ) \ brief Tests whether input vertex is acute
// Determine segment-pair(involving A)  // determine all segments incident on input vertex  // Compute angle between all possible pairs(TODO: NAIVE SOLUTION)