include/opencascade/Intf.hxx

0001 // Created on: 1991-05-23
0002 // Created by: Didier PIFFAULT
0003 // Copyright (c) 1991-1999 Matra Datavision
0004 // Copyright (c) 1999-2014 OPEN CASCADE SAS
0005 //
0006 // This file is part of Open CASCADE Technology software library.
0007 //
0008 // This library is free software; you can redistribute it and/or modify it under
0009 // the terms of the GNU Lesser General Public License version 2.1 as published
0010 // by the Free Software Foundation, with special exception defined in the file
0011 // OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT
0012 // distribution for complete text of the license and disclaimer of any warranty.
0013 //
0014 // Alternatively, this file may be used under the terms of Open CASCADE
0015 // commercial license or contractual agreement.
0016
0017 #ifndef _Intf_HeaderFile
0018 #define _Intf_HeaderFile
0019
0020 #include <Standard.hxx>
0021 #include <Standard_DefineAlloc.hxx>
0022 #include <Standard_Handle.hxx>
0023
0024 #include <Standard_Real.hxx>
0025 #include <Standard_Boolean.hxx>
0026 class gp_Pnt;
0027 class gp_XYZ;
0028
0029 //! Interference computation between polygons, lines and
0030 //! polyhedra with only triangular facets. These objects
0031 //! are polygonal representations of complex curves and
0032 //! triangulated representations of complex surfaces.
0033 class Intf
0034 {
0035 public:
0036   DEFINE_STANDARD_ALLOC
0037
0038   //! Computes the interference between two polygons in 2d.
0039   //! Result : points of intersections and zones of tangence.
0040   //! Computes the interference between a polygon or a straight
0041   //! line and a polyhedron. Points of intersection and zones
0042   //! of tangence.
0043   //! Give the plane equation of the triangle <P1> <P2> <P3>.
0044   Standard_EXPORT static void PlaneEquation(const gp_Pnt& P1,
0045                                             const gp_Pnt& P2,
0046                                             const gp_Pnt& P3,
0047                                             gp_XYZ&       NormalVector,
0048                                             double&       PolarDistance);
0049
0050   //! Compute if the triangle <P1> <P2> <P3> contain <ThePnt>.
0051   Standard_EXPORT static bool Contain(const gp_Pnt& P1,
0052                                       const gp_Pnt& P2,
0053                                       const gp_Pnt& P3,
0054                                       const gp_Pnt& ThePnt);
0055 };
0056
0057 #endif // _Intf_HeaderFile