INTERP_KERNEL Namespace Reference

If defined, use recursion to traverse the binary search tree, else use the BBTree class. More...

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
Enumerations
enum	IntersectionType { Triangulation, Convex, Geometric2D, PointLocator }
enum	SplittingPolicy { PLANAR_FACE_5 = 5, PLANAR_FACE_6 = 6, GENERAL_24 = 24, GENERAL_48 = 48 }
enum	NumberingPolicy { ALL_C_MODE, ALL_FORTRAN_MODE }
enum	NormalizedCellType {   NORM_POINT1 = 0, NORM_SEG2 = 1, NORM_SEG3 = 2, NORM_TRI3 = 3,   NORM_QUAD4 = 4, NORM_POLYGON = 5, NORM_TRI6 = 6, NORM_QUAD8 = 8,   NORM_TETRA4 = 14, NORM_PYRA5 = 15, NORM_PENTA6 = 16, NORM_HEXA8 = 18,   NORM_TETRA10 = 20, NORM_HEXGP12 = 22, NORM_PYRA13 = 23, NORM_PENTA15 = 25,   NORM_HEXA20 = 30, NORM_POLYHED = 31, NORM_ERROR = 40 }
enum	TypeOfFunction { SEG = 1, ARC_CIRCLE = 4, ARC_PARABOL = 8 }
enum	TypeOfMod4QuadEdge { CIRCLE = 0, PARABOL = 1 }
enum	TypeOfLocInEdge {   START = 5, END = 1, INSIDE = 2, OUT_BEFORE = 3,   OUT_AFTER = 4 }
enum	TypeOfEdgeLocInPolygon { FULL_IN_1 = 1, FULL_ON_1 = 4, FULL_OUT_1 = 2, FULL_UNKNOWN = 3 }
enum	TypeOfLocInPolygon {   IN_1 = 7, ON_1 = 8, ON_LIM_1 = 12, ON_TANG_1 = 9,   OUT_1 = 10, UNKNOWN = 11 }
Variables
const unsigned	MAX_SIZE_OF_LINE_XFIG_FILE = 1024

---

Detailed Description

If defined, use recursion to traverse the binary search tree, else use the BBTree class.

---

Enumeration Type Documentation

enum INTERP_KERNEL::IntersectionType

Enumerator:

Triangulation
Convex
Geometric2D
PointLocator

enum INTERP_KERNEL::SplittingPolicy

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.

Enumerator:

PLANAR_FACE_5
PLANAR_FACE_6
GENERAL_24
GENERAL_48

enum INTERP_KERNEL::NumberingPolicy

Enumerator:

ALL_C_MODE
ALL_FORTRAN_MODE

enum INTERP_KERNEL::NormalizedCellType

Enumerator:

NORM_POINT1
NORM_SEG2
NORM_SEG3
NORM_TRI3
NORM_QUAD4
NORM_POLYGON
NORM_TRI6
NORM_QUAD8
NORM_TETRA4
NORM_PYRA5
NORM_PENTA6
NORM_HEXA8
NORM_TETRA10
NORM_HEXGP12
NORM_PYRA13
NORM_PENTA15
NORM_HEXA20
NORM_POLYHED
NORM_ERROR

enum INTERP_KERNEL::TypeOfFunction

Enumerator:

SEG
ARC_CIRCLE
ARC_PARABOL

enum INTERP_KERNEL::TypeOfMod4QuadEdge

Enumerator:

CIRCLE
PARABOL

enum INTERP_KERNEL::TypeOfLocInEdge

Enumerator:

START
END
INSIDE
OUT_BEFORE
OUT_AFTER

enum INTERP_KERNEL::TypeOfEdgeLocInPolygon

Enumerator:

FULL_IN_1
FULL_ON_1
FULL_OUT_1
FULL_UNKNOWN

enum INTERP_KERNEL::TypeOfLocInPolygon

Enumerator:

IN_1
ON_1
ON_LIM_1
ON_TANG_1
OUT_1
UNKNOWN

---

Variable Documentation

const unsigned INTERP_KERNEL::MAX_SIZE_OF_LINE_XFIG_FILE = 1024

Referenced by INTERP_KERNEL::EdgeLin::EdgeLin(), and INTERP_KERNEL::QuadraticPolygon::QuadraticPolygon().