|
||||
File indexing completed on 2025-01-18 10:05:23
0001 // Created on: 1994-03-10 0002 // Created by: Laurent BUCHARD 0003 // Copyright (c) 1994-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 _TopClass_SolidExplorer_HeaderFile 0018 #define _TopClass_SolidExplorer_HeaderFile 0019 0020 #include <Standard.hxx> 0021 #include <Standard_DefineAlloc.hxx> 0022 #include <Standard_Handle.hxx> 0023 0024 #include <Standard_Boolean.hxx> 0025 #include <Standard_Real.hxx> 0026 class gp_Pnt; 0027 class gp_Lin; 0028 class TopoDS_Face; 0029 0030 0031 //! Provide an exploration of a BRep Shape for the 0032 //! classification. Defines the description of a solid for the 0033 //! SolidClassifier. 0034 class TopClass_SolidExplorer 0035 { 0036 public: 0037 0038 DEFINE_STANDARD_ALLOC 0039 0040 0041 //! Should return True if the point is outside a 0042 //! bounding volume of the shape. 0043 Standard_EXPORT virtual Standard_Boolean Reject (const gp_Pnt& P) const = 0; 0044 0045 //! Returns in <L>, <Par> a segment having at least 0046 //! one intersection with the shape boundary to 0047 //! compute intersections. 0048 Standard_EXPORT virtual void Segment (const gp_Pnt& P, gp_Lin& L, Standard_Real& Par) = 0; 0049 0050 //! Returns in <L>, <Par> a segment having at least 0051 //! one intersection with the shape boundary to 0052 //! compute intersections. 0053 //! 0054 //! The First Call to this method returns a line which 0055 //! point to a point of the first face of the shape. 0056 //! The Second Call provide a line to the second face 0057 //! and so on. 0058 //! 0059 //! if the method is called N times on a shape with F 0060 //! faces (N>F) the line point to other points on the 0061 //! face 1,2,3 ... N 0062 Standard_EXPORT virtual void OtherSegment (const gp_Pnt& P, gp_Lin& L, Standard_Real& Par) = 0; 0063 0064 //! Starts an exploration of the shells. 0065 Standard_EXPORT virtual void InitShell() = 0; 0066 0067 //! Returns True if there is a current shell. 0068 Standard_EXPORT virtual Standard_Boolean MoreShells() const = 0; 0069 0070 //! Sets the explorer to the next shell and returns 0071 //! False if there are no more wires. 0072 Standard_EXPORT virtual void NextShell() = 0; 0073 0074 //! Returns True if the shell bounding volume does not 0075 //! intersect the segment. 0076 Standard_EXPORT virtual Standard_Boolean RejectShell (const gp_Lin& L, const Standard_Real Par) const = 0; 0077 0078 //! Starts an exploration of the faces. 0079 Standard_EXPORT virtual void InitFace() = 0; 0080 0081 //! Returns True if there is a current face. 0082 Standard_EXPORT virtual Standard_Boolean MoreFaces() const = 0; 0083 0084 //! Sets the explorer to the next face and returns 0085 //! False if there are no more wires. 0086 Standard_EXPORT virtual void NextFace() = 0; 0087 0088 //! Returns the current face. 0089 Standard_EXPORT virtual TopoDS_Face CurrentFace() const = 0; 0090 0091 //! Returns True if the face bounding volume does not 0092 //! intersect the segment. 0093 Standard_EXPORT virtual Standard_Boolean RejectFace (const gp_Lin& L, const Standard_Real Par) const = 0; 0094 0095 0096 0097 0098 protected: 0099 0100 0101 0102 0103 0104 private: 0105 0106 0107 0108 0109 0110 }; 0111 0112 0113 0114 0115 0116 0117 0118 #endif // _TopClass_SolidExplorer_HeaderFile
[ Source navigation ] | [ Diff markup ] | [ Identifier search ] | [ general search ] |
This page was automatically generated by the 2.3.7 LXR engine. The LXR team |