* Journal of Computational Physics (1999)
*/
- /* ! READ ME FIRST !
+ /** \file TransformedTriangle.hxx
+ * ! READ ME FIRST !
* OVERVIEW of how the class works : (details can be found in the commentaries above each method)
*
* Constructor :
* and the triangle. The end element, NO_* gives the number of elements in the enumeration
* and can be used as end element in loops.
*/
+
/// Corners of tetrahedron
enum TetraCorner { O = 0, X, Y, Z, NO_TET_CORNER };
enum IntersectionPolygon{ A = 0, B, NO_INTERSECTION_POLYGONS };
/// Double products
+ ///
/// NB : order corresponds to TetraEdges (Grandy, table III)
enum DoubleProduct { C_YZ = 0, C_ZX, C_XY, C_ZH, C_XH, C_YH, C_01, C_10, NO_DP };
////////////////////////////////////////////////////////////////////////////////////////
/// Optimization methods. These are only defined and used if OPTIMIZE is defined.
////////////////////////////////////////////////////////////////////////////////////////
+/**
+ * Calls TransformedTriangle::testTriangleSurroundsEdge for edges OX to ZX and stores the result in
+ * member variable array_triangleSurroundsEdgeCache.
+ *
+ */
+
inline void TransformedTriangle::preCalculateTriangleSurroundsEdge()
{
for(TetraEdge edge = OX ; edge <= ZX ; edge = TetraEdge(edge + 1))
return true;
}
- /*
+ /**
* Tests if the given corner of the triangle lies above the XYZ-facet of the tetrahedron.
*
* @param corner corner of the triangle
#endif
#ifndef OPTIMIZE // inlined otherwise -> see TransformedTriangle_inline.hxx
- /*
+ /**
* Tests if the H-coordinates (1 - x - y) for the two end of a segment of the triangle
* lie on different sides of the H = 0 plane.
*
_isDoubleProductsCalculated = true;
}
- /*
+ /**
* Checks if the double products for a given segment are consistent, as defined by
* Grandy, [46]
*
}
#endif OPTIMIZE
- /*
+ /**
* Calculate the shortest distance between a tetrahedron corner and a triangle segment.
*
* @param corner corner of the tetrahedron
