File: Intf.hxx

package info (click to toggle)
oce 0.18.3-2
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 301,548 kB
  • sloc: cpp: 1,190,609; ansic: 67,225; sh: 11,630; tcl: 7,954; cs: 5,221; python: 2,867; java: 1,522; makefile: 342; xml: 292; perl: 37
file content (94 lines) | stat: -rw-r--r-- 2,562 bytes parent folder | download | duplicates (5)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
// This file is generated by WOK (CPPExt).
// Please do not edit this file; modify original file instead.
// The copyright and license terms as defined for the original file apply to 
// this header file considered to be the "object code" form of the original source.

#ifndef _Intf_HeaderFile
#define _Intf_HeaderFile

#include <Standard.hxx>
#include <Standard_DefineAlloc.hxx>
#include <Standard_Macro.hxx>

#include <Standard_Real.hxx>
#include <Standard_Boolean.hxx>
class gp_Pnt;
class gp_XYZ;
class Intf_Polygon2d;
class Intf_Array1OfLin;
class Intf_SectionPoint;
class Intf_SeqOfSectionPoint;
class Intf_SectionLine;
class Intf_SeqOfSectionLine;
class Intf_TangentZone;
class Intf_SeqOfTangentZone;
class Intf_Interference;
class Intf_Tool;
class Intf_InterferencePolygon2d;
class Intf_InterferencePolygonPolyhedron;
class Intf_SequenceNodeOfSeqOfSectionPoint;
class Intf_SequenceNodeOfSeqOfTangentZone;
class Intf_SequenceNodeOfSeqOfSectionLine;


//! Interference computation  between polygons, lines  and
//! polyhedra with only  triangular  facets. These objects
//! are polygonal  representations of complex   curves and
//! triangulated representations of complex surfaces.
class Intf 
{
public:

  DEFINE_STANDARD_ALLOC

  
  //! Computes   the  interference between   two polygons in  2d.
  //! Result : points of intersections and zones of tangence.
  //! Computes the interference  between a polygon or  a straight
  //! line and a polyhedron.   Points of intersection  and zones
  //! of tangence.
  //! Give the plane equation of the triangle <P1> <P2> <P3>.
  Standard_EXPORT static   void PlaneEquation (const gp_Pnt& P1, const gp_Pnt& P2, const gp_Pnt& P3, gp_XYZ& NormalVector, Standard_Real& PolarDistance) ;
  
  //! Compute if the triangle <P1> <P2> <P3> contain <ThePnt>.
  Standard_EXPORT static   Standard_Boolean Contain (const gp_Pnt& P1, const gp_Pnt& P2, const gp_Pnt& P3, const gp_Pnt& ThePnt) ;




protected:





private:




friend class Intf_Polygon2d;
friend class Intf_Array1OfLin;
friend class Intf_SectionPoint;
friend class Intf_SeqOfSectionPoint;
friend class Intf_SectionLine;
friend class Intf_SeqOfSectionLine;
friend class Intf_TangentZone;
friend class Intf_SeqOfTangentZone;
friend class Intf_Interference;
friend class Intf_Tool;
friend class Intf_InterferencePolygon2d;
friend class Intf_InterferencePolygonPolyhedron;
friend class Intf_SequenceNodeOfSeqOfSectionPoint;
friend class Intf_SequenceNodeOfSeqOfTangentZone;
friend class Intf_SequenceNodeOfSeqOfSectionLine;

};







#endif // _Intf_HeaderFile