mirror of
https://git.dev.opencascade.org/repos/occt.git
synced 2025-04-08 18:40:55 +03:00
d5f74e42d6
License statement text corrected; compiler warnings caused by Bison 2.41 disabled for MSVC; a few other compiler warnings on 54-bit Windows eliminated by appropriate type cast Wrong license statements corrected in several files. Copyright and license statements added in XSD and GLSL files. Copyright year updated in some files. Obsolete documentation files removed from DrawResources.
474 lines
14 KiB
C++
474 lines
14 KiB
C++
// Created on: 1999-03-03
|
|
// Created by: Fabrice SERVANT
|
|
// Copyright (c) 1999-1999 Matra Datavision
|
|
// Copyright (c) 1999-2014 OPEN CASCADE SAS
|
|
//
|
|
// This file is part of Open CASCADE Technology software library.
|
|
//
|
|
// This library is free software; you can redistribute it and/or modify it under
|
|
// the terms of the GNU Lesser General Public License version 2.1 as published
|
|
// by the Free Software Foundation, with special exception defined in the file
|
|
// OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT
|
|
// distribution for complete text of the license and disclaimer of any warranty.
|
|
//
|
|
// Alternatively, this file may be used under the terms of Open CASCADE
|
|
// commercial license or contractual agreement.
|
|
|
|
// modified by Edward AGAPOV (eap) Tue Jan 22 12:29:55 2002 (occ53)
|
|
// Modified by skv - Thu Sep 25 18:24:29 2003 OCC567
|
|
|
|
#include <IntPolyh_Intersection.ixx>
|
|
#include <IntPolyh_SectionLine.hxx>
|
|
#include <IntPolyh_StartPoint.hxx>
|
|
#include <IntPolyh_MaillageAffinage.hxx>
|
|
#include <IntPolyh_Couple.hxx>
|
|
#include <IntPolyh_Triangle.hxx>
|
|
|
|
#ifdef DEB
|
|
# define MYDEBUG DEB
|
|
#else
|
|
# define MYDEBUG 0
|
|
#endif
|
|
|
|
Standard_Integer MYDISPLAY = 0;
|
|
Standard_Integer MYPRINT = 0;
|
|
|
|
# if MYDEBUG
|
|
// # include "visudebug.hxx"
|
|
# endif
|
|
|
|
|
|
IntPolyh_Intersection::IntPolyh_Intersection(const Handle(Adaptor3d_HSurface)& S1,
|
|
const Handle(Adaptor3d_HSurface)& S2)
|
|
{
|
|
myNbSU1 = -1;
|
|
myNbSV1 = -1;
|
|
myNbSU2 = -1;
|
|
myNbSV2 = -1;
|
|
mySurf1 = S1;
|
|
mySurf2 = S2;
|
|
done = Standard_False;
|
|
TSectionLines.Init(1000);
|
|
TTangentZones.Init(10000);
|
|
Perform();
|
|
}
|
|
|
|
IntPolyh_Intersection::IntPolyh_Intersection(const Handle(Adaptor3d_HSurface)& S1,
|
|
const Standard_Integer NbSU1,
|
|
const Standard_Integer NbSV1,
|
|
const Handle(Adaptor3d_HSurface)& S2,
|
|
const Standard_Integer NbSU2,
|
|
const Standard_Integer NbSV2)
|
|
{
|
|
myNbSU1 = NbSU1;
|
|
myNbSV1 = NbSV1;
|
|
myNbSU2 = NbSU2;
|
|
myNbSV2 = NbSV2;
|
|
mySurf1 = S1;
|
|
mySurf2 = S2;
|
|
done = Standard_False;
|
|
TSectionLines.Init(1000);
|
|
TTangentZones.Init(10000);
|
|
Perform();
|
|
}
|
|
|
|
void IntPolyh_Intersection::Perform() {
|
|
|
|
done = Standard_True;
|
|
|
|
Standard_Boolean startFromAdvanced = Standard_False;
|
|
Standard_Boolean isStdDone = Standard_False;
|
|
Standard_Boolean isAdvDone = Standard_False;
|
|
Standard_Integer nbCouplesStd = 0;
|
|
Standard_Integer nbCouplesAdv = 0;
|
|
|
|
//GeomAbs_SurfaceType ST1 = mySurf1->GetType();
|
|
//GeomAbs_SurfaceType ST2 = mySurf2->GetType();
|
|
|
|
// if(ST1 == GeomAbs_Torus || ST2 == GeomAbs_Torus)
|
|
// startFromAdvanced = Standard_True;
|
|
|
|
IntPolyh_PMaillageAffinage aPMaillageStd = 0;
|
|
IntPolyh_PMaillageAffinage aPMaillageFF = 0;
|
|
IntPolyh_PMaillageAffinage aPMaillageFR = 0;
|
|
IntPolyh_PMaillageAffinage aPMaillageRF = 0;
|
|
IntPolyh_PMaillageAffinage aPMaillageRR = 0;
|
|
|
|
|
|
if(!startFromAdvanced) {
|
|
|
|
isStdDone = PerformStd(aPMaillageStd,nbCouplesStd);
|
|
|
|
// default interference done well, use it
|
|
if(isStdDone && nbCouplesStd > 10) {
|
|
aPMaillageStd->StartPointsChain(TSectionLines, TTangentZones);
|
|
}
|
|
// default interference done, but too few interferences foud;
|
|
// use advanced interference
|
|
else if(isStdDone && nbCouplesStd <= 10) {
|
|
isAdvDone = PerformAdv(aPMaillageFF,aPMaillageFR,aPMaillageRF,aPMaillageRR,nbCouplesAdv);
|
|
|
|
// advanced interference found
|
|
if(isAdvDone && nbCouplesAdv > 10) {
|
|
aPMaillageFF->StartPointsChain(TSectionLines,TTangentZones);
|
|
aPMaillageFR->StartPointsChain(TSectionLines,TTangentZones);
|
|
aPMaillageRF->StartPointsChain(TSectionLines,TTangentZones);
|
|
aPMaillageRR->StartPointsChain(TSectionLines,TTangentZones);
|
|
}
|
|
else {
|
|
// use result of default
|
|
if(nbCouplesStd > 0)
|
|
aPMaillageStd->StartPointsChain(TSectionLines, TTangentZones);
|
|
}
|
|
}
|
|
// default interference faild, use advanced
|
|
else {
|
|
// isAdvDone = PerformAdv(aPMaillageFF,aPMaillageFR,aPMaillageRF,aPMaillageRR,nbCouplesAdv);
|
|
|
|
// if(isAdvDone && nbCouplesAdv > 0) {cout << "4adv done, nbc: " << nbCouplesAdv << endl;
|
|
// aPMaillageFF->StartPointsChain(TSectionLines,TTangentZones);
|
|
// aPMaillageFR->StartPointsChain(TSectionLines,TTangentZones);
|
|
// aPMaillageRF->StartPointsChain(TSectionLines,TTangentZones);
|
|
// aPMaillageRR->StartPointsChain(TSectionLines,TTangentZones);
|
|
// }
|
|
}
|
|
}// start from default
|
|
else {
|
|
|
|
isAdvDone = PerformAdv(aPMaillageFF,aPMaillageFR,aPMaillageRF,aPMaillageRR,nbCouplesAdv);
|
|
|
|
// advanced done, interference found; use it
|
|
if(isAdvDone) {
|
|
|
|
if(nbCouplesAdv > 0) {
|
|
aPMaillageFF->StartPointsChain(TSectionLines,TTangentZones);
|
|
aPMaillageFR->StartPointsChain(TSectionLines,TTangentZones);
|
|
aPMaillageRF->StartPointsChain(TSectionLines,TTangentZones);
|
|
aPMaillageRR->StartPointsChain(TSectionLines,TTangentZones);
|
|
}
|
|
else {
|
|
isStdDone = PerformStd(aPMaillageStd,nbCouplesStd);
|
|
if(isStdDone && nbCouplesStd > 0)
|
|
aPMaillageStd->StartPointsChain(TSectionLines, TTangentZones);
|
|
}
|
|
}
|
|
else {
|
|
isStdDone = PerformStd(aPMaillageStd,nbCouplesStd);
|
|
if(isStdDone && nbCouplesStd > 0)
|
|
aPMaillageStd->StartPointsChain(TSectionLines, TTangentZones);
|
|
}
|
|
} // start from advanced
|
|
|
|
// accept result
|
|
nbsectionlines = TSectionLines.NbItems();
|
|
nbtangentzones = TTangentZones.NbItems();
|
|
|
|
// clean up
|
|
if(aPMaillageStd) delete aPMaillageStd;
|
|
if(aPMaillageFF) delete aPMaillageFF;
|
|
if(aPMaillageFR) delete aPMaillageFR;
|
|
if(aPMaillageRF) delete aPMaillageRF;
|
|
if(aPMaillageRR) delete aPMaillageRR;
|
|
|
|
// verify
|
|
if(!isStdDone && !isAdvDone)
|
|
done = Standard_False;
|
|
}
|
|
|
|
|
|
Standard_Boolean IntPolyh_Intersection::IsDone() const {
|
|
return(done);
|
|
}
|
|
|
|
|
|
Standard_Integer IntPolyh_Intersection::NbSectionLines() const {
|
|
return(nbsectionlines);
|
|
}
|
|
|
|
|
|
Standard_Integer IntPolyh_Intersection::NbPointsInLine(const Standard_Integer IndexLine) const {
|
|
|
|
return(TSectionLines[IndexLine-1].NbStartPoints());
|
|
}
|
|
|
|
|
|
Standard_Integer IntPolyh_Intersection::NbPointsInTangentZone(const Standard_Integer) const {
|
|
//-- IndexLine--; (pas implemente) Attention : Tableaux de 0 a n-1
|
|
// eap
|
|
// return(TTangentZones.NbTangentZones());
|
|
return 1;
|
|
}
|
|
|
|
|
|
Standard_Integer IntPolyh_Intersection::NbTangentZones() const {
|
|
return(nbtangentzones);
|
|
}
|
|
|
|
|
|
void IntPolyh_Intersection::GetLinePoint(const Standard_Integer Indexl,
|
|
const Standard_Integer Indexp,
|
|
Standard_Real &x,
|
|
Standard_Real &y,
|
|
Standard_Real &z,
|
|
Standard_Real &u1,
|
|
Standard_Real &v1,
|
|
Standard_Real &u2,
|
|
Standard_Real &v2,
|
|
Standard_Real &incidence) const {
|
|
const IntPolyh_SectionLine &msl=TSectionLines[Indexl-1];
|
|
const IntPolyh_StartPoint &sp=msl[Indexp-1];
|
|
x=sp.X();
|
|
y=sp.Y();
|
|
z=sp.Z();
|
|
u1=sp.U1();
|
|
v1=sp.V1();
|
|
u2=sp.U2();
|
|
v2=sp.V2();
|
|
incidence=sp.GetAngle();
|
|
}
|
|
|
|
|
|
void IntPolyh_Intersection::GetTangentZonePoint(const Standard_Integer Indexz,
|
|
const Standard_Integer /*Indexp*/,
|
|
Standard_Real &x,
|
|
Standard_Real &y,
|
|
Standard_Real &z,
|
|
Standard_Real &u1,
|
|
Standard_Real &v1,
|
|
Standard_Real &u2,
|
|
Standard_Real &v2) const {
|
|
//-- Indexz--; tableaux C
|
|
// eap
|
|
//const IntPolyh_StartPoint &sp=TTangentZones[Indexp-1];
|
|
const IntPolyh_StartPoint &sp=TTangentZones[Indexz-1];
|
|
x=sp.X();
|
|
y=sp.Y();
|
|
z=sp.Y();
|
|
u1=sp.U1();
|
|
v1=sp.V1();
|
|
u2=sp.U2();
|
|
v2=sp.V2();
|
|
}
|
|
|
|
// Modified by skv - Thu Sep 25 18:07:41 2003 OCC567 Begin
|
|
//=======================================================================
|
|
//function : PerformMaillage
|
|
//purpose : Computes MaillageAffinage
|
|
//=======================================================================
|
|
Standard_Boolean IntPolyh_Intersection::PerformMaillage
|
|
(const Standard_Boolean isFirstFwd,
|
|
const Standard_Boolean isSecondFwd,
|
|
IntPolyh_PMaillageAffinage &theMaillageS)
|
|
{
|
|
if (myNbSU1 == -1)
|
|
theMaillageS = new IntPolyh_MaillageAffinage(mySurf1, mySurf2, MYPRINT);
|
|
else
|
|
theMaillageS = new IntPolyh_MaillageAffinage(mySurf1, myNbSU1, myNbSV1,
|
|
mySurf2, myNbSU2, myNbSV2,
|
|
MYPRINT);
|
|
|
|
theMaillageS->FillArrayOfPnt(1, isFirstFwd);
|
|
theMaillageS->FillArrayOfPnt(2, isSecondFwd);
|
|
|
|
|
|
Standard_Real xx0,yy0,zz0,xx1,yy1,zz1;
|
|
theMaillageS->CommonBox(theMaillageS->GetBox(1), theMaillageS->GetBox(2),
|
|
xx0, yy0, zz0, xx1, yy1, zz1);
|
|
|
|
theMaillageS->FillArrayOfEdges(1);
|
|
theMaillageS->FillArrayOfEdges(2);
|
|
|
|
theMaillageS->FillArrayOfTriangles(1);
|
|
theMaillageS->FillArrayOfTriangles(2);
|
|
|
|
theMaillageS->LinkEdges2Triangles();
|
|
|
|
theMaillageS->TrianglesDeflectionsRefinementBSB();
|
|
|
|
Standard_Integer FinTTC = theMaillageS->TriangleCompare();
|
|
|
|
// if too many intersections, consider surfaces parallel (eap)
|
|
if(FinTTC > 200 &&
|
|
(FinTTC >= theMaillageS->GetArrayOfTriangles(1).NbItems() ||
|
|
FinTTC >= theMaillageS->GetArrayOfTriangles(2).NbItems()) ) {
|
|
return Standard_False;
|
|
}
|
|
|
|
return Standard_True;
|
|
}
|
|
|
|
//=======================================================================
|
|
//function : PerformMaillage
|
|
//purpose : Computes MaillageAffinage
|
|
//=======================================================================
|
|
Standard_Boolean IntPolyh_Intersection::PerformMaillage(IntPolyh_PMaillageAffinage &theMaillageS)
|
|
{
|
|
if (myNbSU1 == -1)
|
|
theMaillageS = new IntPolyh_MaillageAffinage(mySurf1, mySurf2, MYPRINT);
|
|
else
|
|
theMaillageS = new IntPolyh_MaillageAffinage(mySurf1, myNbSU1, myNbSV1,
|
|
mySurf2, myNbSU2, myNbSV2,
|
|
MYPRINT);
|
|
|
|
theMaillageS->FillArrayOfPnt(1);
|
|
theMaillageS->FillArrayOfPnt(2);
|
|
|
|
|
|
Standard_Real xx0,yy0,zz0,xx1,yy1,zz1;
|
|
theMaillageS->CommonBox(theMaillageS->GetBox(1), theMaillageS->GetBox(2),
|
|
xx0, yy0, zz0, xx1, yy1, zz1);
|
|
|
|
theMaillageS->FillArrayOfEdges(1);
|
|
theMaillageS->FillArrayOfEdges(2);
|
|
|
|
theMaillageS->FillArrayOfTriangles(1);
|
|
theMaillageS->FillArrayOfTriangles(2);
|
|
|
|
theMaillageS->LinkEdges2Triangles();
|
|
|
|
theMaillageS->TrianglesDeflectionsRefinementBSB();
|
|
|
|
Standard_Integer FinTTC = theMaillageS->TriangleCompare();
|
|
|
|
if( FinTTC == 0 ) {
|
|
Standard_Boolean myZone = Standard_True;
|
|
theMaillageS->SetEnlargeZone( myZone );
|
|
theMaillageS->FillArrayOfPnt(1);
|
|
theMaillageS->FillArrayOfPnt(2);
|
|
theMaillageS->CommonBox(theMaillageS->GetBox(1), theMaillageS->GetBox(2),
|
|
xx0, yy0, zz0, xx1, yy1, zz1);
|
|
theMaillageS->FillArrayOfEdges(1);
|
|
theMaillageS->FillArrayOfEdges(2);
|
|
theMaillageS->FillArrayOfTriangles(1);
|
|
theMaillageS->FillArrayOfTriangles(2);
|
|
theMaillageS->LinkEdges2Triangles();
|
|
theMaillageS->TrianglesDeflectionsRefinementBSB();
|
|
FinTTC = theMaillageS->TriangleCompare();
|
|
myZone = Standard_False;
|
|
theMaillageS->SetEnlargeZone( myZone );
|
|
}
|
|
|
|
/*
|
|
// if too many intersections, consider surfaces parallel (eap)
|
|
if(FinTTC > 200 &&
|
|
(FinTTC >= theMaillageS->GetArrayOfTriangles(1).NbTriangles() ||
|
|
FinTTC >= theMaillageS->GetArrayOfTriangles(2).NbTriangles()) ) {
|
|
return Standard_False;
|
|
}
|
|
*/
|
|
|
|
return Standard_True;
|
|
}
|
|
|
|
//=======================================================================
|
|
//function : MergeCouples
|
|
//purpose : This method analyzes arrays to find same couples. If some
|
|
// are detected it leaves the couple in only one array
|
|
// deleting from others.
|
|
//=======================================================================
|
|
|
|
void IntPolyh_Intersection::MergeCouples
|
|
(IntPolyh_ArrayOfCouples &anArrayFF,
|
|
IntPolyh_ArrayOfCouples &anArrayFR,
|
|
IntPolyh_ArrayOfCouples &anArrayRF,
|
|
IntPolyh_ArrayOfCouples &anArrayRR) const
|
|
{
|
|
// Step 1: Sorting arrays.
|
|
IntPolyh_ArrayOfCouples *anArrays[4];
|
|
Standard_Integer aNbCouples[4];
|
|
Standard_Integer i;
|
|
IntPolyh_ArrayOfCouples *aTmpPtr;
|
|
Standard_Integer aTmpNbr;
|
|
|
|
anArrays[0] = &anArrayFF;
|
|
anArrays[1] = &anArrayFR;
|
|
anArrays[2] = &anArrayRF;
|
|
anArrays[3] = &anArrayRR;
|
|
|
|
for (i = 0; i < 4; i++)
|
|
aNbCouples[i] = anArrays[i]->NbItems();
|
|
|
|
Standard_Boolean isChanged = Standard_True;
|
|
|
|
while (isChanged) {
|
|
isChanged = Standard_False;
|
|
|
|
for (i = 0; i < 3; i++) {
|
|
if (aNbCouples[i] < aNbCouples[i + 1]) {
|
|
aTmpPtr = anArrays[i];
|
|
anArrays[i] = anArrays[i + 1];
|
|
anArrays[i + 1] = aTmpPtr;
|
|
aTmpNbr = aNbCouples[i];
|
|
aNbCouples[i] = aNbCouples[i + 1];
|
|
aNbCouples[i + 1] = aTmpNbr;
|
|
isChanged = Standard_True;
|
|
}
|
|
}
|
|
}
|
|
|
|
// Step 2: Searching for same couples.
|
|
Standard_Integer j;
|
|
Standard_Integer indC1;
|
|
Standard_Integer indC2;
|
|
|
|
for (i = 0; i < 3; i++) {
|
|
for (j = i + 1; j < 4; j++) {
|
|
for (indC1 = 1; indC1 <= aNbCouples[i]; indC1++) {
|
|
IntPolyh_Couple &aCouple1 = anArrays[i]->ChangeValue(indC1);
|
|
|
|
if (aCouple1.AnalyseFlagValue() == 1)
|
|
continue;
|
|
|
|
for (indC2 = 1; indC2 <= aNbCouples[j]; indC2++) {
|
|
IntPolyh_Couple &aCouple2 = anArrays[j]->ChangeValue(indC2);
|
|
|
|
if (aCouple2.AnalyseFlagValue() == 1)
|
|
continue;
|
|
|
|
if (aCouple1.FirstValue() == aCouple2.FirstValue() &&
|
|
aCouple1.SecondValue() == aCouple2.SecondValue()) {
|
|
aCouple2.SetAnalyseFlag(1);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
// Modified by skv - Thu Sep 25 18:07:42 2003 OCC567 End
|
|
|
|
Standard_Boolean IntPolyh_Intersection::PerformStd(IntPolyh_PMaillageAffinage& MaillageS,
|
|
Standard_Integer& NbCouples)
|
|
{
|
|
Standard_Boolean isdone = PerformMaillage(MaillageS);
|
|
NbCouples = (isdone) ? (MaillageS->GetArrayOfCouples().NbItems()) : 0;
|
|
return isdone;
|
|
}
|
|
|
|
Standard_Boolean IntPolyh_Intersection::PerformAdv(IntPolyh_PMaillageAffinage& MaillageFF,
|
|
IntPolyh_PMaillageAffinage& MaillageFR,
|
|
IntPolyh_PMaillageAffinage& MaillageRF,
|
|
IntPolyh_PMaillageAffinage& MaillageRR,
|
|
Standard_Integer& NbCouples)
|
|
{
|
|
Standard_Boolean isdone = Standard_True;
|
|
NbCouples = 0;
|
|
|
|
if(!PerformMaillage(Standard_True,Standard_False,MaillageFR) ||
|
|
!PerformMaillage(Standard_False,Standard_True,MaillageRF) ||
|
|
!PerformMaillage(Standard_True,Standard_True,MaillageFF) ||
|
|
!PerformMaillage(Standard_False,Standard_False,MaillageRR) )
|
|
isdone = Standard_False;
|
|
|
|
if(isdone) {
|
|
NbCouples = MaillageFF->GetArrayOfCouples().NbItems() +
|
|
MaillageFR->GetArrayOfCouples().NbItems() +
|
|
MaillageRF->GetArrayOfCouples().NbItems() +
|
|
MaillageRR->GetArrayOfCouples().NbItems();
|
|
|
|
if(NbCouples > 0)
|
|
MergeCouples(MaillageFF->GetArrayOfCouples(),MaillageFR->GetArrayOfCouples(),
|
|
MaillageRF->GetArrayOfCouples(),MaillageRR->GetArrayOfCouples());
|
|
}
|
|
return isdone;
|
|
}
|