1 // Created on: 1991-05-23 2 // Created by: Didier PIFFAULT 3 // Copyright (c) 1991-1999 Matra Datavision 4 // Copyright (c) 1999-2014 OPEN CASCADE SAS 5 // 6 // This file is part of Open CASCADE Technology software library. 7 // 8 // This library is free software; you can redistribute it and/or modify it under 9 // the terms of the GNU Lesser General Public License version 2.1 as published 10 // by the Free Software Foundation, with special exception defined in the file 11 // OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT 12 // distribution for complete text of the license and disclaimer of any warranty. 13 // 14 // Alternatively, this file may be used under the terms of Open CASCADE 15 // commercial license or contractual agreement. 16 17 #ifndef _Intf_HeaderFile 18 #define _Intf_HeaderFile 19 20 #include <Standard.hxx> 21 #include <Standard_DefineAlloc.hxx> 22 #include <Standard_Handle.hxx> 23 24 #include <Standard_Real.hxx> 25 #include <Standard_Boolean.hxx> 26 class gp_Pnt; 27 class gp_XYZ; 28 class Intf_Polygon2d; 29 class Intf_SectionPoint; 30 class Intf_SectionLine; 31 class Intf_TangentZone; 32 class Intf_Interference; 33 class Intf_Tool; 34 class Intf_InterferencePolygon2d; 35 class Intf_InterferencePolygonPolyhedron; 36 37 38 //! Interference computation between polygons, lines and 39 //! polyhedra with only triangular facets. These objects 40 //! are polygonal representations of complex curves and 41 //! triangulated representations of complex surfaces. 42 class Intf 43 { 44 public: 45 46 DEFINE_STANDARD_ALLOC 47 48 49 //! Computes the interference between two polygons in 2d. 50 //! Result : points of intersections and zones of tangence. 51 //! Computes the interference between a polygon or a straight 52 //! line and a polyhedron. Points of intersection and zones 53 //! of tangence. 54 //! Give the plane equation of the triangle <P1> <P2> <P3>. 55 Standard_EXPORT static void PlaneEquation (const gp_Pnt& P1, const gp_Pnt& P2, const gp_Pnt& P3, gp_XYZ& NormalVector, Standard_Real& PolarDistance); 56 57 //! Compute if the triangle <P1> <P2> <P3> contain <ThePnt>. 58 Standard_EXPORT static Standard_Boolean Contain (const gp_Pnt& P1, const gp_Pnt& P2, const gp_Pnt& P3, const gp_Pnt& ThePnt); 59 60 61 62 63 protected: 64 65 66 67 68 69 private: 70 71 72 73 74 friend class Intf_Polygon2d; 75 friend class Intf_SectionPoint; 76 friend class Intf_SectionLine; 77 friend class Intf_TangentZone; 78 friend class Intf_Interference; 79 friend class Intf_Tool; 80 friend class Intf_InterferencePolygon2d; 81 friend class Intf_InterferencePolygonPolyhedron; 82 83 }; 84 85 86 87 88 89 90 91 #endif // _Intf_HeaderFile 92