1
0
mirror of https://git.dev.opencascade.org/repos/occt.git synced 2025-08-19 13:40:49 +03:00

Integration of OCCT 6.5.0 from SVN

This commit is contained in:
bugmaster
2011-03-16 07:30:28 +00:00
committed by bugmaster
parent 4903637061
commit 7fd59977df
16375 changed files with 3882564 additions and 0 deletions

View File

@@ -0,0 +1,924 @@
// File: BRepClass3d_SolidExplorer.cxx
// Created: Thu Mar 10 14:52:22 1994
// Author: Laurent BUCHARD
// <lbr@fuegox>
// Modifed: Portage NT 7-5-97 DPF (stdio.h)
// Apr 16 2002 eap, classification against infinite solid (occ299)
// Modified by skv - Thu Sep 4 12:29:30 2003 OCC578
//-- Traiter le cas d un trou !!
#define REJECTION 1
//-- Pour printf sur NT
#include <stdio.h>
#include <BRepClass3d_SolidExplorer.ixx>
#include <gp.hxx>
#include <TopoDS.hxx>
#include <BRepAdaptor_Curve2d.hxx>
#include <BRepTools.hxx>
#include <Geom2d_Curve.hxx>
#include <gp_Vec2d.hxx>
#include <GeomAbs_Shape.hxx>
#include <BRepAdaptor_Surface.hxx>
#include <BRepClass_FacePassiveClassifier.hxx>
#include <TopAbs_Orientation.hxx>
#include <TopExp_Explorer.hxx>
#include <BRepClass_Edge.hxx>
#include <Bnd_Box.hxx>
#include <BRepBndLib.hxx>
#include <BRepAdaptor_HSurface.hxx>
#include <ElCLib.hxx>
#include <BRepClass3d_DataMapIteratorOfMapOfInter.hxx>
#include <Precision.hxx>
//OCC454(apo)->
#include <Extrema_ExtPS.hxx>
#include <BRep_Tool.hxx>
#include <BRepClass_FaceClassifier.hxx>
//<-OCC454(apo)
static Standard_Integer numedg=0;
static gp_Vec staticd1u_gp_vec;
static gp_Vec staticd1v_gp_vec;
//=======================================================================
//function : FindAPointInTheFace
//purpose : compute a point P in the face F. Param is a Real in
// ]0,1[ and is used to initialise the algorithm. For
// different values , different points are returned.
//=======================================================================
Standard_Boolean BRepClass3d_SolidExplorer::FindAPointInTheFace
(const TopoDS_Face& _face,
gp_Pnt& APoint_,
Standard_Real& param_)
{
Standard_Real u,v;
Standard_Boolean r = FindAPointInTheFace(_face,APoint_,u,v,param_);
return r;
}
//=======================================================================
//function : FindAPointInTheFace
//purpose :
//=======================================================================
Standard_Boolean BRepClass3d_SolidExplorer::FindAPointInTheFace
(const TopoDS_Face& _face,
gp_Pnt& APoint_,
Standard_Real& u_, Standard_Real& v_,
Standard_Real& param_)
{
TopoDS_Face face=_face;
face.Orientation(TopAbs_FORWARD);
TopExp_Explorer faceexplorer;
BRepAdaptor_Curve2d c;
gp_Vec2d T;
gp_Pnt2d P;
//Standard_Boolean Ok = Standard_False;
Standard_Integer nedg=1;
for (faceexplorer.Init(face,TopAbs_EDGE);
faceexplorer.More();
faceexplorer.Next()) {
if(numedg==0 || nedg++==numedg) {
TopoDS_Edge Edge = TopoDS::Edge(faceexplorer.Current());
c.Initialize(Edge,face);
#ifdef DEB
Standard_Integer nbinterval =
#endif
c.NbIntervals(GeomAbs_C1);
c.D1((c.LastParameter() - c.FirstParameter()) * param_ + c.FirstParameter(),P,T);
Standard_Real x=T.X();
Standard_Real y=T.Y();
if(Edge.Orientation() == TopAbs_FORWARD) {
T.SetCoord(-y,x);
}
else {
T.SetCoord(y,-x);
}
Standard_Real ParamInit = RealLast();
Standard_Real TolInit = 0.00001;
Standard_Boolean APointExist = Standard_False;
BRepClass_FacePassiveClassifier FClassifier;
T.Normalize();
P.SetCoord(P.X()+TolInit*T.X(),P.Y()+TolInit*T.Y());
FClassifier.Reset(gp_Lin2d(P,T),ParamInit,RealEpsilon()); //-- Longueur et Tolerance #######
TopExp_Explorer otherfaceexplorer;
// Modified by Sergey KHROMOV - Tue Apr 1 11:32:51 2003 Begin
Standard_Integer aNbEdges = 0;
for (otherfaceexplorer.Init(face,TopAbs_EDGE);
otherfaceexplorer.More();
otherfaceexplorer.Next(), aNbEdges++) {
// for (otherfaceexplorer.Init(face,TopAbs_EDGE);
// otherfaceexplorer.More();
// otherfaceexplorer.Next()) {
// Modified by Sergey KHROMOV - Tue Apr 1 11:32:52 2003 End
TopoDS_Edge OtherEdge = TopoDS::Edge(otherfaceexplorer.Current());
if((OtherEdge.Orientation() == TopAbs_EXTERNAL ||
OtherEdge == Edge)) {
}
else {
BRepClass_Edge AEdge(OtherEdge,face);
FClassifier.Compare(AEdge,OtherEdge.Orientation());
if(FClassifier.ClosestIntersection()) {
//-- cout<<" ---> Edge : "<<FClassifier.Parameter()<<endl;
if(ParamInit > FClassifier.Parameter()) {
ParamInit = FClassifier.Parameter();
APointExist = Standard_True;
}
}
}
}
// Modified by Sergey KHROMOV - Tue Apr 1 11:34:36 2003 Begin
if (aNbEdges == 1) {
BRepClass_Edge AEdge(Edge,face);
FClassifier.Compare(AEdge,Edge.Orientation());
if(FClassifier.ClosestIntersection()) {
if(ParamInit > FClassifier.Parameter()) {
ParamInit = FClassifier.Parameter();
APointExist = Standard_True;
}
}
}
// Modified by Sergey KHROMOV - Tue Apr 1 11:34:36 2003 End
if(APointExist) {
ParamInit*=0.41234;
u_ = P.X() + ParamInit* T.X();
v_ = P.Y() + ParamInit* T.Y();
BRepAdaptor_Surface s;
s.Initialize(face,Standard_False);
s.D1(u_,v_,APoint_,staticd1u_gp_vec,staticd1v_gp_vec);
return(Standard_True);
}
}
}
return(Standard_False);
}
//=======================================================================
//function : PointInTheFace
//purpose :
//=======================================================================
Standard_Boolean BRepClass3d_SolidExplorer::PointInTheFace
(const TopoDS_Face& Face,
gp_Pnt& APoint_,
Standard_Real& u_, Standard_Real& v_,
Standard_Real& param_,
Standard_Integer& IndexPoint,
const Handle(BRepAdaptor_HSurface)& surf,
const Standard_Real U1,
const Standard_Real V1,
const Standard_Real U2,
const Standard_Real V2 ) const
{
Standard_Real u,du = (U2-U1)/6.0;
Standard_Real v,dv = (V2-V1)/6.0;
if(du<1e-12) du=1e-12;
if(dv<1e-12) dv=1e-12;
Standard_Integer NbPntCalc=0;
if(myMapOfInter.IsBound(Face)) {
void *ptr = (void*)(myMapOfInter.Find(Face));
if(ptr) {
const IntCurvesFace_Intersector& TheIntersector = (*((IntCurvesFace_Intersector *)ptr));
//-- On prend les 4 points dans chaque Quart de surface
//-- -> Index : 1 -> 16
//--
//--
//-- Puis on prend une matrice de points sur une grille serree
//--
for(u=du+(U1+U2)*0.5; u<U2; u+=du) { //-- 0 X u croit
for(v=dv+(V1+V2)*0.5; v<V2; v+=dv) { //-- 0 0 v croit
if(++NbPntCalc>=IndexPoint) {
if(TheIntersector.ClassifyUVPoint(gp_Pnt2d(u,v))==TopAbs_IN) {
u_=u; v_=v;
surf->D1(u,v,APoint_,staticd1u_gp_vec,staticd1v_gp_vec);
IndexPoint = NbPntCalc;
return(Standard_True);
}
}
}
}
for(u=-du+(U1+U2)*0.5; u>U1; u-=du) { //-- 0 0 u decroit
for(v=-dv+(V1+V2)*0.5; v>V1; v-=dv) { //-- X 0 v decroit
if(++NbPntCalc>=IndexPoint) {
if(TheIntersector.ClassifyUVPoint(gp_Pnt2d(u,v))==TopAbs_IN) {
u_=u; v_=v;
surf->D1(u,v,APoint_,staticd1u_gp_vec,staticd1v_gp_vec);
IndexPoint = NbPntCalc;
return(Standard_True);
}
}
}
}
for(u=-du+(U1+U2)*0.5; u>U1; u-=du) { //-- X 0 u decroit
for(v=dv+(V1+V2)*0.5; v<V2; v+=dv) { //-- 0 0 v croit
if(++NbPntCalc>=IndexPoint) {
if(TheIntersector.ClassifyUVPoint(gp_Pnt2d(u,v))==TopAbs_IN) {
u_=u; v_=v;
surf->D1(u,v,APoint_,staticd1u_gp_vec,staticd1v_gp_vec);
IndexPoint = NbPntCalc;
return(Standard_True);
}
}
}
}
for(u=du+(U1+U2)*0.5; u<U2; u+=du) { //-- 0 0 u croit
for(v=-dv+(V1+V2)*0.5; v>V1; v-=dv) { //-- 0 X v decroit
if(++NbPntCalc>=IndexPoint) {
if(TheIntersector.ClassifyUVPoint(gp_Pnt2d(u,v))==TopAbs_IN) {
u_=u; v_=v;
surf->D1(u,v,APoint_,staticd1u_gp_vec,staticd1v_gp_vec);
IndexPoint = NbPntCalc;
return(Standard_True);
}
}
}
}
//-- le reste
du = (U2-U1)/37.0;
dv = (V2-V1)/37.0;
if(du<1e-12) du=1e-12;
if(dv<1e-12) dv=1e-12;
for(u=du+U1; u<U2; u+=du) {
for(v=dv+V1; v<V2; v+=dv) {
if(++NbPntCalc>=IndexPoint) {
if(TheIntersector.ClassifyUVPoint(gp_Pnt2d(u,v))==TopAbs_IN) {
u_=u; v_=v;
surf->D1(u,v,APoint_,staticd1u_gp_vec,staticd1v_gp_vec);
IndexPoint = NbPntCalc;
return(Standard_True);
}
}
}
}
u=(U1+U2)*0.5;
v=(V1+V2)*0.5;
if(++NbPntCalc>=IndexPoint) {
if(TheIntersector.ClassifyUVPoint(gp_Pnt2d(u,v))==TopAbs_IN) {
u_=u; v_=v;
surf->D1(u,v,APoint_,staticd1u_gp_vec,staticd1v_gp_vec);
IndexPoint = NbPntCalc;
return(Standard_True);
}
}
}
IndexPoint = NbPntCalc;
}
else {
//printf("BRepClass3d_SolidExplorer Face non trouvee ds la map \n");
}
return(BRepClass3d_SolidExplorer::FindAPointInTheFace(Face,APoint_,u_,v_,param_));
}
//=======================================================================
//function : LimitInfiniteUV
//purpose : Limit infinite parameters
//=======================================================================
static void LimitInfiniteUV (Standard_Real& U1,
Standard_Real& V1,
Standard_Real& U2,
Standard_Real& V2)
{
Standard_Boolean
infU1 = Precision::IsNegativeInfinite(U1),
infV1 = Precision::IsNegativeInfinite(V1),
infU2 = Precision::IsPositiveInfinite(U2),
infV2 = Precision::IsPositiveInfinite(V2);
if (infU1) U1 = -1e10;
if (infV1) V1 = -1e10;
if (infU2) U2 = 1e10;
if (infV2) V2 = 1e10;
}
// Modified by skv - Tue Sep 16 13:50:38 2003 OCC578 Begin
//OCC454(apo)->
// static Standard_Boolean IsInfiniteUV (Standard_Real& U1, Standard_Real& V1, Standard_Real& U2, Standard_Real& V2) {
// return (Precision::IsNegativeInfinite(U1) || Precision::IsNegativeInfinite(V1) ||
// Precision::IsNegativeInfinite(U2) || Precision::IsNegativeInfinite(V2));
// }
static Standard_Integer IsInfiniteUV (Standard_Real& U1, Standard_Real& V1,
Standard_Real& U2, Standard_Real& V2) {
Standard_Integer aVal = 0;
if (Precision::IsInfinite(U1))
aVal |= 1;
if (Precision::IsInfinite(V1))
aVal |= 2;
if (Precision::IsInfinite(U2))
aVal |= 4;
if (Precision::IsInfinite(V2))
aVal |= 8;
return aVal;
}
//<-OCC454
// Modified by skv - Tue Sep 16 13:50:39 2003 OCC578 End
//=======================================================================
//function : OtherSegment
//purpose : Returns in <L>, <Par> a segment having at least
// one intersection with the shape boundary to
// compute intersections.
// The First Call to this method returns a line which
// point to a point of the first face of the shape.
// The Second Call provide a line to the second face
// and so on.
//=======================================================================
//modified by NIZNHY-PKV Thu Nov 14 14:34:05 2002 f
//void BRepClass3d_SolidExplorer::OtherSegment(const gp_Pnt& P,
// gp_Lin& L,
// Standard_Real& _Par)
Standard_Integer BRepClass3d_SolidExplorer::OtherSegment(const gp_Pnt& P,
gp_Lin& L,
Standard_Real& _Par)
//modified by NIZNHY-PKV Thu Nov 14 14:34:10 2002 t
{
TopoDS_Face face;
TopExp_Explorer faceexplorer;
//TopExp_Explorer edgeexplorer;
gp_Pnt APoint;
Standard_Real maxscal=0;
Standard_Boolean ptfound=Standard_False;
Standard_Real Par;
//Standard_Integer i=1;
Standard_Real _u,_v;
Standard_Integer IndexPoint=0;
Standard_Integer NbPointsOK=0;
Standard_Integer NbFacesInSolid=0;
do {
myFirstFace++;
faceexplorer.Init(myShape,TopAbs_FACE);
// look for point on face starting from myFirstFace
// Modified by skv - Thu Sep 4 14:31:12 2003 OCC578 Begin
// while (faceexplorer.More()) {
for (; faceexplorer.More(); faceexplorer.Next()) {
// Modified by skv - Thu Sep 4 14:31:12 2003 OCC578 End
NbFacesInSolid++;
if (myFirstFace > NbFacesInSolid) continue;
face = TopoDS::Face(faceexplorer.Current());
Handle(BRepAdaptor_HSurface) surf = new BRepAdaptor_HSurface();
surf->ChangeSurface().Initialize(face);
Standard_Real U1,V1,U2,V2;
U1 = surf->FirstUParameter();
V1 = surf->FirstVParameter();
U2 = surf->LastUParameter();
V2 = surf->LastVParameter();
face.Orientation(TopAbs_FORWARD);
//
//avoid process faces from uncorrected shells
if( Abs (U2 - U1) < 1.e-12 || Abs(V2 - V1) < 1.e-12) {
//modified by NIZNHY-PKV Thu Nov 14 15:03:18 2002 f
//gp_Vec avoidV(gp_Pnt(0.,0.,0.),gp_Pnt(0.,0.,1.));
//gp_Lin avoidL(gp_Pnt(0.,0.,0.),avoidV);
//_Par = RealLast();
//L = avoidL;
return 2;
//return ;
//modified by NIZNHY-PKV Thu Nov 14 12:25:33 2002 t
}
//
Standard_Real svmyparam=myParamOnEdge;
//
// Modified by skv - Tue Sep 16 13:55:27 2003 OCC578 Begin
// Check if the point is on the face or the face is infinite.
Standard_Integer anInfFlag = IsInfiniteUV(U1,V1,U2,V2);
// if(IsInfiniteUV(U1,V1,U2,V2)){//OCC454(apo)->
GeomAdaptor_Surface GA(BRep_Tool::Surface(face));
static Standard_Real TolU = Precision::PConfusion(), TolV = TolU;
Extrema_ExtPS Ext(P,GA,TolU,TolV);
if (Ext.IsDone() && Ext.NbExt() > 0) {
// evaluate the lower distance and its index;
Standard_Real Dist2, Dist2Min = Ext.SquareDistance(1);
Standard_Integer iNear = 1, i = 2, iEnd = Ext.NbExt();
for (i = 2; i <= iEnd; i++) {
Dist2 = Ext.SquareDistance(i);
if (Dist2 < Dist2Min) {
Dist2Min = Dist2; iNear = i;
}
}
//modified by NIZNHY-PKV Thu Nov 14 12:31:01 2002 f
Standard_Real aDist2Tresh=1.e-24;
if (Dist2Min<aDist2Tresh) {
if (anInfFlag) {
return 1;
} else {
BRepClass_FaceClassifier classifier2d;
Standard_Real aU;
Standard_Real aV;
(Ext.Point(iNear)).Parameter(aU, aV);
gp_Pnt2d aPuv(aU, aV);
classifier2d.Perform(face,aPuv,Precision::PConfusion());
TopAbs_State aState = classifier2d.State();
if (aState == TopAbs_IN || aState == TopAbs_ON)
return 1;
else
return 3; // skv - the point is on surface but outside face.
}
}
//modified by NIZNHY-PKV Thu Nov 14 12:31:03 2002 t
if (anInfFlag) {
APoint = (Ext.Point(iNear)).Value();
gp_Vec V(P,APoint);
_Par = V.Magnitude();
L = gp_Lin(P,V);
ptfound=Standard_True;
numedg=0;
//modified by NIZNHY-PKV Thu Nov 14 12:25:28 2002 f
//return ;
return 0;
//modified by NIZNHY-PKV Thu Nov 14 12:25:33 2002 t
}
//<-OCC454(apo)
// }else{
}
//The point is not ON the face or surface. The face is restricted.
// find point in a face not too far from a projection of P on face
// Modified by skv - Tue Sep 16 15:25:00 2003 OCC578 End
do {
if(PointInTheFace(face,APoint,_u,_v,myParamOnEdge,++IndexPoint,surf,U1,V1,U2,V2)) {
NbPointsOK++;
gp_Vec V(P,APoint);
Par = V.Magnitude();
if(Par > gp::Resolution()) {
gp_Vec Norm=staticd1u_gp_vec.Crossed(staticd1v_gp_vec);
Standard_Real tt = Norm.Magnitude();
tt=Abs(Norm.Dot(V))/(tt*Par);
if(tt>maxscal) {
maxscal=tt;
L = gp_Lin(P,V);
_Par=Par;
ptfound=Standard_True;
if(maxscal>0.2) {
myParamOnEdge=svmyparam;
numedg=0;
//modified by NIZNHY-PKV Thu Nov 14 12:25:28 2002 f
//return ;
return 0;
//modified by NIZNHY-PKV Thu Nov 14 12:25:33 2002 t
}
}
}
}
}
while(IndexPoint<200 && NbPointsOK<16);
myParamOnEdge=svmyparam;
numedg=0;
if(maxscal>0.2) {
//modified by NIZNHY-PKV Thu Nov 14 12:25:28 2002 f
//return ;
return 0;
//modified by NIZNHY-PKV Thu Nov 14 12:25:33 2002 t
}
// Modified by skv - Thu Sep 4 14:32:14 2003 OCC578 Begin
// Next is done in the main for(..) loop.
// faceexplorer.Next();
// Modified by skv - Thu Sep 4 14:32:14 2003 OCC578 End
IndexPoint = 0;
Standard_Boolean encoreuneface = faceexplorer.More();
if(ptfound==Standard_False && encoreuneface==Standard_False) {
if(myParamOnEdge < 0.0001) {
//-- Ce cas se produit lorsque le point est sur le solide
//-- et ce solide est reduit a une face
gp_Pnt PBidon(P.X()+1.0,P.Y(),P.Z());
gp_Vec V(P,PBidon);
Par= 1.0;
_Par=Par;
L = gp_Lin(P,V);
//modified by NIZNHY-PKV Thu Nov 14 12:25:28 2002 f
//return ;
return 0;
//modified by NIZNHY-PKV Thu Nov 14 12:25:33 2002 t
//-- cout<<" FindAPoint **** Pas OK "<<endl;
}
}
} //-- Exploration of the faces
if(NbFacesInSolid==0) {
_Par=0.0;
myReject=Standard_True;
#if DEB
cout<<"\nWARNING : BRepClass3d_SolidExplorer.cxx (Solid sans face)"<<endl;
#endif
//modified by NIZNHY-PKV Thu Nov 14 12:25:28 2002 f
//return ;
return 0;
//modified by NIZNHY-PKV Thu Nov 14 12:25:33 2002 t
}
if(ptfound) {
//modified by NIZNHY-PKV Thu Nov 14 12:25:28 2002 f
//return ;
return 0;
//modified by NIZNHY-PKV Thu Nov 14 12:25:33 2002 t
}
myFirstFace = 0;
if(myParamOnEdge==0.512345) myParamOnEdge = 0.4;
else if(myParamOnEdge==0.4) myParamOnEdge = 0.6;
else if(myParamOnEdge==0.6) myParamOnEdge = 0.3;
else if(myParamOnEdge==0.3) myParamOnEdge = 0.7;
else if(myParamOnEdge==0.7) myParamOnEdge = 0.2;
else if(myParamOnEdge==0.2) myParamOnEdge = 0.8;
else if(myParamOnEdge==0.8) myParamOnEdge = 0.1;
else if(myParamOnEdge==0.1) myParamOnEdge = 0.9;
else { myParamOnEdge*=0.5; }
} //-- do { ... }
while(1);
//modified by NIZNHY-PKV Thu Nov 14 12:25:28 2002 f
//return ;
return 0;
//modified by NIZNHY-PKV Thu Nov 14 12:25:33 2002 t
}
// Modified by skv - Thu Sep 4 12:30:14 2003 OCC578 Begin
//=======================================================================
//function : GetFaceSegmentIndex
//purpose : Returns the index of face for which last segment is calculated.
//=======================================================================
Standard_Integer BRepClass3d_SolidExplorer::GetFaceSegmentIndex() const
{
return myFirstFace;
}
// Modified by skv - Thu Sep 4 12:30:14 2003 OCC578 End
//=======================================================================
//function : PointInTheFace
//purpose :
//=======================================================================
Standard_Boolean BRepClass3d_SolidExplorer::PointInTheFace
(const TopoDS_Face& _face,
gp_Pnt& APoint_,
Standard_Real& u_, Standard_Real& v_,
Standard_Real& param_,
Standard_Integer& IndexPoint) const
{
TopoDS_Face Face = _face;
Face.Orientation(TopAbs_FORWARD);
Handle(BRepAdaptor_HSurface) surf = new BRepAdaptor_HSurface();
surf->ChangeSurface().Initialize(Face);
Standard_Real U1,V1,U2,V2;//,u,v;
U1 = surf->FirstUParameter();
V1 = surf->FirstVParameter();
U2 = surf->LastUParameter();
V2 = surf->LastVParameter();
LimitInfiniteUV (U1,V1,U2,V2);
return(PointInTheFace(Face,APoint_,u_,v_,param_,IndexPoint,surf,U1,V1,U2,V2));
}
//=======================================================================
//function : FindAPointInTheFace
//purpose :
//=======================================================================
Standard_Boolean BRepClass3d_SolidExplorer::FindAPointInTheFace
(const TopoDS_Face& _face,
gp_Pnt& APoint_,
Standard_Real& u_,Standard_Real& v_)
{
Standard_Real param = 0.1;
Standard_Boolean r = FindAPointInTheFace(_face,APoint_,u_,v_,param);
return r;
}
//=======================================================================
//function : FindAPointInTheFace
//purpose :
//=======================================================================
Standard_Boolean BRepClass3d_SolidExplorer::FindAPointInTheFace
(const TopoDS_Face& _face,
gp_Pnt& APoint_)
{ Standard_Real u,v;
Standard_Boolean r = FindAPointInTheFace(_face,APoint_,u,v);
return r;
}
//=======================================================================
//function : FindAPointInTheFace
//purpose :
//=======================================================================
Standard_Boolean BRepClass3d_SolidExplorer::FindAPointInTheFace
(const TopoDS_Face& _face,
Standard_Real& u_,Standard_Real& v_)
{ gp_Pnt APoint;
Standard_Boolean r = FindAPointInTheFace(_face,APoint,u_,v_);
return r;
}
//=======================================================================
//function : BRepClass3d_SolidExplorer
//purpose :
//=======================================================================
BRepClass3d_SolidExplorer::BRepClass3d_SolidExplorer()
{
}
#include <Standard_ConstructionError.hxx>
//=======================================================================
//function : BRepClass3d_SolidExplorer
//purpose : Raise if called.
//=======================================================================
//BRepClass3d_SolidExplorer::BRepClass3d_SolidExplorer(const BRepClass3d_SolidExplorer& Oth)
BRepClass3d_SolidExplorer::BRepClass3d_SolidExplorer(const BRepClass3d_SolidExplorer& )
{
Standard_ConstructionError::Raise("Magic constructor not allowed");
}
//=======================================================================
//function : BRepClass3d_SolidExplorer
//purpose :
//=======================================================================
BRepClass3d_SolidExplorer::BRepClass3d_SolidExplorer(const TopoDS_Shape& S)
{
InitShape(S);
}
//=======================================================================
//function : Delete
//purpose :
//=======================================================================
void BRepClass3d_SolidExplorer::Delete()
{
Destroy() ;
}
//=======================================================================
//function : Destroy
//purpose : C++: alias ~
//=======================================================================
void BRepClass3d_SolidExplorer::Destroy() {
BRepClass3d_DataMapIteratorOfMapOfInter iter(myMapOfInter);
for(;iter.More();iter.Next()) {
void *ptr=iter.Value();
if(ptr) {
delete (IntCurvesFace_Intersector *)ptr;
myMapOfInter.ChangeFind(iter.Key()) = NULL;
}
}
myMapOfInter.Clear();
}
//=======================================================================
//function : InitShape
//purpose :
//=======================================================================
void BRepClass3d_SolidExplorer::InitShape(const TopoDS_Shape& S)
{
myShape = S;
myFirstFace = 0;
myParamOnEdge = 0.512345;
//-- Exploration de la Map et delete sur les objets alloues
BRepClass3d_DataMapIteratorOfMapOfInter iter(myMapOfInter);
for(;iter.More();iter.Next()) {
void *ptr=iter.Value();
if(ptr) {
delete (IntCurvesFace_Intersector *)ptr;
myMapOfInter.ChangeFind(iter.Key()) = NULL;
}
}
myMapOfInter.Clear();
myReject = Standard_True; //-- cas de solide infini (sans aucune face)
TopExp_Explorer Expl;
for(Expl.Init(S,TopAbs_FACE);
Expl.More();
Expl.Next()) {
const TopoDS_Face Face = TopoDS::Face(Expl.Current());
void *ptr = (void *)(new IntCurvesFace_Intersector(Face,Precision::Confusion()));
myMapOfInter.Bind(Face,ptr);
myReject=Standard_False; //-- au moins une face dans le solide
}
#if DEB
if(myReject) {
cout<<"\nWARNING : BRepClass3d_SolidExplorer.cxx (Solid sans face)"<<endl;
}
#endif
#if REJECTION
BRepBndLib::Add(myShape,myBox);
#endif
}
//=======================================================================
//function : Reject
//purpose : Should return True if P outside of bounding vol. of the shape
//=======================================================================
//Standard_Boolean BRepClass3d_SolidExplorer::Reject(const gp_Pnt& P) const
Standard_Boolean BRepClass3d_SolidExplorer::Reject(const gp_Pnt& ) const
{
return(myReject); // cas de solide sans face
}
//=======================================================================
//function : InitShell
//purpose : Starts an exploration of the shells.
//=======================================================================
void BRepClass3d_SolidExplorer::InitShell()
{
myShellExplorer.Init(myShape,TopAbs_SHELL);
}
//=======================================================================
//function : MoreShell
//purpose : Returns True if there is a current shell.
//=======================================================================
Standard_Boolean BRepClass3d_SolidExplorer::MoreShell() const
{
return(myShellExplorer.More());
}
//=======================================================================
//function : NextShell
//purpose : Sets the explorer to the next shell.
//=======================================================================
void BRepClass3d_SolidExplorer::NextShell()
{
myShellExplorer.Next();
}
//=======================================================================
//function : CurrentShell
//purpose : Returns the current shell.
//=======================================================================
TopoDS_Shell BRepClass3d_SolidExplorer::CurrentShell() const
{
return(TopoDS::Shell(myShellExplorer.Current()));
}
//=======================================================================
//function : RejectShell
//purpose : Returns True if the Shell is rejected.
//=======================================================================
Standard_Boolean BRepClass3d_SolidExplorer::RejectShell(const gp_Lin& ) const
{
return(Standard_False);
}
//=======================================================================
//function : InitFace
//purpose : Starts an exploration of the faces of the current shell.
//=======================================================================
void BRepClass3d_SolidExplorer::InitFace()
{
myFaceExplorer.Init(TopoDS::Shell(myShellExplorer.Current()),TopAbs_FACE);
}
//=======================================================================
//function : MoreFace
//purpose : Returns True if current face in current shell.
//=======================================================================
Standard_Boolean BRepClass3d_SolidExplorer::MoreFace() const
{
return(myFaceExplorer.More());
}
//=======================================================================
//function : NextFace
//purpose : Sets the explorer to the next Face of the current shell.
//=======================================================================
void BRepClass3d_SolidExplorer::NextFace()
{
myFaceExplorer.Next();
}
//=======================================================================
//function : CurrentFace
//purpose : Returns the current face.
//=======================================================================
TopoDS_Face BRepClass3d_SolidExplorer::CurrentFace() const
{
return(TopoDS::Face(myFaceExplorer.Current()));
}
//=======================================================================
//function : RejectFace
//purpose : returns True if the face is rejected.
//=======================================================================
Standard_Boolean BRepClass3d_SolidExplorer::RejectFace(const gp_Lin& ) const
{
return(Standard_False);
}
#ifdef DEB
#include <TopAbs_State.hxx>
#endif
//=======================================================================
//function : Segment
//purpose : Returns in <L>, <Par> a segment having at least
// one intersection with the shape boundary to
// compute intersections.
//=======================================================================
//modified by NIZNHY-PKV Thu Nov 14 14:40:35 2002 f
//void BRepClass3d_SolidExplorer::Segment(const gp_Pnt& P,
// gp_Lin& L,
// Standard_Real& Par) {
// myFirstFace = 0;
// OtherSegment(P,L,Par);
//}
Standard_Integer BRepClass3d_SolidExplorer::Segment(const gp_Pnt& P,
gp_Lin& L,
Standard_Real& Par)
{
Standard_Integer bRetFlag;
myFirstFace = 0;
bRetFlag=OtherSegment(P,L,Par);
return bRetFlag;
}
//modified by NIZNHY-PKV Thu Nov 14 14:41:48 2002 t
//=======================================================================
//function : Intersector
//purpose :
//=======================================================================
IntCurvesFace_Intersector& BRepClass3d_SolidExplorer::Intersector(const TopoDS_Face& F) const {
void *ptr = (void*)(myMapOfInter.Find(F));
#ifndef DEB
IntCurvesFace_Intersector& curr = (*((IntCurvesFace_Intersector *)ptr));
return curr;
#else
return(*((IntCurvesFace_Intersector *)ptr));
#endif
}
//=======================================================================
//function : Box
//purpose :
//=======================================================================
const Bnd_Box& BRepClass3d_SolidExplorer::Box() const {
return(myBox);
}
//=======================================================================
//function : DumpSegment
//purpose :
//=======================================================================
void BRepClass3d_SolidExplorer::DumpSegment(const gp_Pnt&,
const gp_Lin&,
const Standard_Real,
const TopAbs_State) const
{
#ifdef DEB
// rien pour le moment.
#endif
}