1
0
mirror of https://git.dev.opencascade.org/repos/occt.git synced 2025-04-10 18:51:21 +03:00
occt/src/TopOpeBRepBuild/TopOpeBRepBuild_Area3dBuilder.cxx
abv 42cf5bc1ca 0024002: Overall code and build procedure refactoring -- automatic
Automatic upgrade of OCCT code by command "occt_upgrade . -nocdl":
- WOK-generated header files from inc and sources from drv are moved to src
- CDL files removed
- All packages are converted to nocdlpack
2015-07-12 07:42:38 +03:00

213 lines
7.4 KiB
C++

// Created on: 1995-12-21
// Created by: Jean Yves LEBEY
// Copyright (c) 1995-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.
#include <TopOpeBRepBuild_Area3dBuilder.hxx>
#include <TopOpeBRepBuild_Loop.hxx>
#include <TopOpeBRepBuild_LoopClassifier.hxx>
#include <TopOpeBRepBuild_LoopSet.hxx>
//=======================================================================
//function : TopOpeBRepBuild_Area3dBuilder
//purpose :
//=======================================================================
TopOpeBRepBuild_Area3dBuilder::TopOpeBRepBuild_Area3dBuilder()
{
}
//=======================================================================
//function : TopOpeBRepBuild_Area3dBuilder
//purpose :
//=======================================================================
TopOpeBRepBuild_Area3dBuilder::TopOpeBRepBuild_Area3dBuilder
(TopOpeBRepBuild_LoopSet& LS, TopOpeBRepBuild_LoopClassifier& LC,
const Standard_Boolean ForceClass)
{
InitAreaBuilder(LS,LC,ForceClass);
}
//=======================================================================
//function : InitAreaBuilder
//purpose :
//=======================================================================
void TopOpeBRepBuild_Area3dBuilder::InitAreaBuilder
(TopOpeBRepBuild_LoopSet& LS,
TopOpeBRepBuild_LoopClassifier& LC,
const Standard_Boolean ForceClass)
{
TopAbs_State state;
Standard_Boolean Loopinside;
Standard_Boolean loopoutside;
TopOpeBRepBuild_ListIteratorOfListOfListOfLoop AreaIter;
TopOpeBRepBuild_ListIteratorOfListOfLoop LoopIter;
// boundaryloops : list of boundary loops out of the areas.
TopOpeBRepBuild_ListOfLoop boundaryloops;
myArea.Clear(); // Clear the list of Area to be built
for (LS.InitLoop(); LS.MoreLoop(); LS.NextLoop()) {
// process a new loop : L is the new current Loop
const Handle(TopOpeBRepBuild_Loop)& L = LS.Loop();
Standard_Boolean boundaryL = L->IsShape();
// L = shape et ForceClass : on traite L comme un block
// L = shape et !ForceClass : on traite L comme un pur shape
// L = !shape : on traite L comme un block
Standard_Boolean traitercommeblock = (!boundaryL) || ForceClass;
if ( ! traitercommeblock ) {
// the loop L is a boundary loop :
// - try to insert it in an existing area, such as L is inside all
// the block loops. Only block loops of the area are compared.
// - if L could not be inserted, store it in list of boundary loops.
Loopinside = Standard_False;
for (AreaIter.Initialize(myArea); AreaIter.More(); AreaIter.Next()) {
TopOpeBRepBuild_ListOfLoop& aArea = AreaIter.Value();
if ( aArea.IsEmpty() ) continue;
state = CompareLoopWithListOfLoop(LC,L,aArea,TopOpeBRepBuild_BLOCK );
if (state == TopAbs_UNKNOWN) Atomize(state,TopAbs_IN);
Loopinside = ( state == TopAbs_IN);
if ( Loopinside ) break;
} // end of Area scan
if ( Loopinside ) {
TopOpeBRepBuild_ListOfLoop& aArea = AreaIter.Value();
ADD_Loop_TO_LISTOFLoop(L,aArea,(void*)("IN, to current area"));
}
else if ( ! Loopinside ) {
ADD_Loop_TO_LISTOFLoop(L,boundaryloops,(void*)("! IN, to boundaryloops"));
}
} // end of boundary loop
else {
// the loop L is a block loop
// if L is IN theArea :
// - stop area scan, insert L in theArea.
// - remove from the area all the loops outside L
// - make a new area with them, unless they are all boundary
// - if they are all boundary put them back in boundaryLoops
// else :
// - create a new area with L.
// - insert boundary loops that are IN the new area
// (and remove them from 'boundaryloops')
Loopinside = Standard_False;
for (AreaIter.Initialize(myArea); AreaIter.More(); AreaIter.Next() ) {
TopOpeBRepBuild_ListOfLoop& aArea = AreaIter.Value();
if ( aArea.IsEmpty() ) continue;
state = CompareLoopWithListOfLoop(LC,L,aArea,TopOpeBRepBuild_ANYLOOP);
if (state == TopAbs_UNKNOWN) Atomize(state,TopAbs_IN);
Loopinside = (state == TopAbs_IN);
if ( Loopinside ) break;
} // end of Area scan
if ( Loopinside) {
TopOpeBRepBuild_ListOfLoop& aArea = AreaIter.Value();
Standard_Boolean allShape = Standard_True;
TopOpeBRepBuild_ListOfLoop removedLoops;
LoopIter.Initialize(aArea);
while (LoopIter.More()) {
const Handle(TopOpeBRepBuild_Loop)& LLI1 = LoopIter.Value();
state = LC.Compare(LLI1,L);
if (state == TopAbs_UNKNOWN) Atomize(state,TopAbs_IN); // not OUT
loopoutside = ( state == TopAbs_OUT );
if ( loopoutside ) {
const Handle(TopOpeBRepBuild_Loop)& curL = LoopIter.Value();
// remove the loop from the area
ADD_Loop_TO_LISTOFLoop
(curL,removedLoops,(void*)("loopoutside = 1, area = removedLoops"));
allShape = allShape && curL->IsShape();
REM_Loop_FROM_LISTOFLoop
(LoopIter,AreaIter.Value(),(void*)("loop of cur. area, cur. area"));
}
else {
LoopIter.Next();
}
}
// insert the loop in the area
ADD_Loop_TO_LISTOFLoop(L,aArea,(void*)("area = current"));
if ( ! removedLoops.IsEmpty() ) {
if ( allShape ) {
ADD_LISTOFLoop_TO_LISTOFLoop
(removedLoops,boundaryloops,(void*)(
"allShape = 1"),(void*)("removedLoops"),(void*)("boundaryloops"));
}
else {
// make a new area with the removed loops
TopOpeBRepBuild_ListOfLoop thelist;
myArea.Append(thelist);
ADD_LISTOFLoop_TO_LISTOFLoop
(removedLoops,myArea.Last(),
(void*)("allShape = 0"),(void*)("removedLoops"),(void*)("new area"));
}
}
} // Loopinside == True
else {
Standard_Integer ashapeinside,ablockinside;
TopOpeBRepBuild_ListOfLoop thelist1;
myArea.Append( thelist1);
TopOpeBRepBuild_ListOfLoop& newArea0 = myArea.Last();
ADD_Loop_TO_LISTOFLoop(L,newArea0,(void*)("new area"));
LoopIter.Initialize(boundaryloops);
while ( LoopIter.More() ) {
ashapeinside = ablockinside = Standard_False;
const Handle(TopOpeBRepBuild_Loop)& LLI2 = LoopIter.Value();
state = LC.Compare(LLI2,L);
if (state == TopAbs_UNKNOWN) Atomize(state,TopAbs_IN);
ashapeinside = (state == TopAbs_IN);
if (ashapeinside) {
const Handle(TopOpeBRepBuild_Loop)& LLI3 = LoopIter.Value();
state = LC.Compare(L,LLI3);
if (state == TopAbs_UNKNOWN) Atomize(state,TopAbs_IN);
ablockinside = (state == TopAbs_IN);
}
if ( ashapeinside && ablockinside ) {
const Handle(TopOpeBRepBuild_Loop)& curL = LoopIter.Value();
ADD_Loop_TO_LISTOFLoop
(curL,newArea0,(void*)("ashapeinside && ablockinside, new area"));
REM_Loop_FROM_LISTOFLoop
(LoopIter,boundaryloops,(void*)("loop of boundaryloops, boundaryloops"));
}
else {
LoopIter.Next();
}
} // end of boundaryloops scan
} // Loopinside == False
} // end of block loop
} // end of LoopSet LS scan
InitArea();
}