Classes | |
class | Interpolation |
class | Interpolation2D |
class | Interpolation3D |
Class used to calculate the volumes of intersection between the elements of two 3D meshes. More... | |
class | Interpolation3DSurf |
class | InterpolationOptions |
class | PlanarIntersector |
class | TargetIntersector |
Abstract base class of Intersector classes. These classes represent a target element and calculate its intersection with the source elements. More... | |
class | GenericMesh |
class | IteratorOnComposedEdge |
class | ComposedEdge |
class | MergePoints |
class | IntersectElement |
class | EdgeIntersector |
class | SameTypeEdgeIntersector |
class | CrossTypeEdgeIntersector |
class | Edge |
class | ArcCArcCIntersector |
class | ArcCSegIntersector |
class | EdgeArcCircle |
class | SegSegIntersector |
class | EdgeLin |
class | ElementaryEdge |
class | Node |
class | QuadraticPolygon |
Variables | |
const unsigned | MAX_SIZE_OF_LINE_XFIG_FILE = 1024 |
If defined, use recursion to traverse the binary search tree, else use the BBTree class.
Type describing the different ways in which the hexahedron can be split into tetrahedra. The PLANAR_* policies persume that each face is to be considered planar, while the general policies make no such hypothesis. The integer at the end gives the number of tetrahedra that result from the split.
const unsigned INTERP_KERNEL::MAX_SIZE_OF_LINE_XFIG_FILE = 1024 |
Referenced by INTERP_KERNEL::EdgeLin::EdgeLin(), and INTERP_KERNEL::QuadraticPolygon::QuadraticPolygon().