src/cdtGen.cpp
/*! \fn size_t CDTGenerator::computeCircumradius(CGALPoint &A, CGALPoint &B, CGALPoint &encroachingCandidate)
    \brief Computes circumradius of circle defined by input points.

    \param [in] A Endpoint 1 of constraint segment
    \param [in] B Endpoint 2 of constraint segment
    \param [in] encroachingCandidate Candidate for reference point
*/
\fn size_t CDTGenerator::computeCircumradius(CGALPoint &A, CGALPoint &B, CGALPoint &encroachingCandidate)
\brief Computes circumradius of circle defined by input points.

\param [in] A Endpoint 1 of constraint segment
\param [in] B Endpoint 2 of constraint segment
\param [in] encroachingCandidate Candidate for reference point
\ fn size_t CDTGenerator :: computeCircumradius ( CGALPoint &A CGALPoint &B CGALPoint &encroachingCandidate ) \ brief Computes circumradius of circle defined by input points . \ param [ in ] A Endpoint 1 of constraint segment \ param [ in ] B Endpoint 2 of constraint segment \ param [ in ] encroachingCandidate Candidate for reference point
size_t CDTGenerator::computeCircumradius(CGALPoint &A, CGALPoint &B, CGALPoint &encroachingCandidate)
{
	float a, b, c;
	float circumradius;
	a = sqrt(pow((A.x() - encroachingCandidate.x()), 2)+ pow((A.y() - encroachingCandidate.y()), 2) + pow((A.z() - encroachingCandidate.z()), 2));
	b = sqrt(pow((B.x() - encroachingCandidate.x()), 2)+ pow((B.y() - encroachingCandidate.y()), 2) + pow((B.z() - encroachingCandidate.z()), 2));
	c = sqrt(pow((A.x() - B.x()), 2)+ pow((A.y() - B.y()), 2) + pow((A.z() - B.z()), 2));
	return circumradius = (a * b * c) / sqrt((a + b + c) * (b + c - a) * (c + a - b) * (a + b - c));
}
size_t CDTGenerator :: computeCircumradius ( CGALPoint & A , CGALPoint & B , CGALPoint & encroachingCandidate ) { float a , b , c ; float circumradius ; a = sqrt ( pow ( ( A . x ( ) - encroachingCandidate . x ( ) ) , 2 ) + pow ( ( A . y ( ) - encroachingCandidate . y ( ) ) , 2 ) + pow ( ( A . z ( ) - encroachingCandidate . z ( ) ) , 2 ) ) ; b = sqrt ( pow ( ( B . x ( ) - encroachingCandidate . x ( ) ) , 2 ) + pow ( ( B . y ( ) - encroachingCandidate . y ( ) ) , 2 ) + pow ( ( B . z ( ) - encroachingCandidate . z ( ) ) , 2 ) ) ; c = sqrt ( pow ( ( A . x ( ) - B . x ( ) ) , 2 ) + pow ( ( A . y ( ) - B . y ( ) ) , 2 ) + pow ( ( A . z ( ) - B . z ( ) ) , 2 ) ) ; return circumradius = ( a * b * c ) / sqrt ( ( a + b + c ) * ( b + c - a ) * ( c + a - b ) * ( a + b - c ) ) ; }
\fn size_t CDTGenerator::computeCircumradius(CGALPoint &A, CGALPoint &B, CGALPoint &encroachingCandidate)
\brief Computes circumradius of circle defined by input points.
\ fn size_t CDTGenerator :: computeCircumradius ( CGALPoint &A CGALPoint &B CGALPoint &encroachingCandidate ) \ brief Computes circumradius of circle defined by input points .
// computing circumradius of a triangle: