mirror of
https://git.dev.opencascade.org/repos/occt.git
synced 2025-04-16 10:08:36 +03:00
42cf5bc1ca
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
276 lines
7.3 KiB
C++
276 lines
7.3 KiB
C++
// Created on: 1991-06-24
|
|
// Created by: Didier PIFFAULT
|
|
// Copyright (c) 1991-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 <gp_Pnt.hxx>
|
|
#include <gp_Pnt2d.hxx>
|
|
#include <Intf_Interference.hxx>
|
|
#include <Intf_SectionLine.hxx>
|
|
#include <Intf_SectionPoint.hxx>
|
|
#include <Intf_TangentZone.hxx>
|
|
#include <Standard_OutOfRange.hxx>
|
|
|
|
//=======================================================================
|
|
//function : Intf_Interference
|
|
//purpose : Initialize for a deferred interference.
|
|
//=======================================================================
|
|
Intf_Interference::Intf_Interference (const Standard_Boolean Self)
|
|
: SelfIntf(Self)
|
|
{}
|
|
|
|
|
|
//=======================================================================
|
|
//function : SelfInterference
|
|
//purpose : Reset interference before perform with a new...
|
|
//=======================================================================
|
|
|
|
void Intf_Interference::SelfInterference (const Standard_Boolean Self)
|
|
{
|
|
SelfIntf=Self;
|
|
mySPoins.Clear();
|
|
mySLines.Clear();
|
|
myTZones.Clear();
|
|
}
|
|
|
|
|
|
//=======================================================================
|
|
//function : Insert
|
|
//purpose : Insert a tangent zone in the list of the interference
|
|
//=======================================================================
|
|
|
|
Standard_Boolean Intf_Interference::Insert(const Intf_TangentZone& LaZone)
|
|
{
|
|
if (myTZones.Length()<=0) return Standard_False;
|
|
Standard_Integer lzin=0; // Index in the list of the zone of interest.
|
|
Standard_Integer lunp=0; // Index of the 1st stop point in this zone.
|
|
Standard_Integer lotp=0; // Index of the 2nd stop point in this zone.
|
|
Standard_Integer lunl=0; // Index of the 1st point of the new zone.
|
|
Standard_Integer lotl=0; // Index of the 2nd point of the new zone.
|
|
Standard_Boolean same=Standard_False; // Search direction of the stop of the new zone.
|
|
Standard_Boolean Inserted=Standard_True; // Has the insertion succeeded ?
|
|
Standard_Integer npcz=-1; // Number of points in the current zone
|
|
Standard_Integer nplz=LaZone.NumberOfPoints(); // in the new zone
|
|
|
|
// Loop on TangentZone :
|
|
for (Standard_Integer Iz=1; Iz<=myTZones.Length(); Iz++) {
|
|
|
|
// Loop on edges of the TangentZone :
|
|
npcz=myTZones(Iz).NumberOfPoints();
|
|
Standard_Integer Ipz0, Ipz1, Ipz2;
|
|
for (Ipz1=1; Ipz1<=npcz; Ipz1++) {
|
|
Ipz0=Ipz1-1;
|
|
if (Ipz0<=0) Ipz0=npcz;
|
|
Ipz2=(Ipz1%npcz)+1;
|
|
|
|
// Loop on edges of the new TangentZone and search of the
|
|
// corresponding point or edge:
|
|
Standard_Integer Ilz1, Ilz2;
|
|
for (Ilz1=1; Ilz1<=nplz; Ilz1++) {
|
|
Ilz2=(Ilz1%nplz)+1;
|
|
|
|
if ((myTZones(Iz).GetPoint(Ipz1)).IsEqual
|
|
(LaZone.GetPoint(Ilz1))) {
|
|
if ((myTZones(Iz).GetPoint(Ipz0)).IsEqual
|
|
(LaZone.GetPoint(Ilz2))) {
|
|
lzin=Iz;
|
|
lunp=Ipz0;
|
|
lotp=Ipz1;
|
|
lunl=Ilz1;
|
|
lotl=Ilz2;
|
|
same=Standard_False;
|
|
break;
|
|
}
|
|
else if ((myTZones(Iz).GetPoint(Ipz2)).IsEqual
|
|
(LaZone.GetPoint(Ilz2))) {
|
|
lzin=Iz;
|
|
lunp=Ipz1;
|
|
lotp=Ipz2;
|
|
lunl=Ilz1;
|
|
lotl=Ilz2;
|
|
same=Standard_True;
|
|
break;
|
|
}
|
|
else {
|
|
lzin=Iz;
|
|
lunp=Ipz1;
|
|
lunl=Ilz1;
|
|
}
|
|
}
|
|
}
|
|
if (lotp!=0) break;
|
|
}
|
|
if (lotp!=0) break;
|
|
}
|
|
|
|
Standard_Integer Ilc;
|
|
if (lotp!=0) {
|
|
for (Ilc=lotl+1; (((Ilc-1)%nplz)+1)!=lunl; Ilc++) {
|
|
myTZones(lzin).InsertBefore
|
|
(lotp, LaZone.GetPoint(((Ilc-1)%nplz)+1));
|
|
if (!same) lotp++;
|
|
}
|
|
}
|
|
|
|
else if (lunp>0) {
|
|
Standard_Boolean loop=Standard_False;
|
|
for (Ilc=lunl; ; Ilc++) {
|
|
myTZones(lzin).InsertBefore(lunp,
|
|
LaZone.GetPoint((((Ilc-1)%nplz)+1)));
|
|
lunp++;
|
|
if (loop && (((Ilc-1)%nplz)+1)==lunl) break;
|
|
loop=Standard_True;
|
|
}
|
|
}
|
|
|
|
else {
|
|
Inserted =Standard_False;
|
|
}
|
|
|
|
if (Inserted) {
|
|
Intf_TangentZone theNew=myTZones(lzin);
|
|
myTZones.Remove(lzin);
|
|
if (!Insert(theNew))
|
|
myTZones.Append(theNew);
|
|
}
|
|
return Inserted;
|
|
}
|
|
|
|
//=======================================================================
|
|
//function : Insert
|
|
//purpose :
|
|
//=======================================================================
|
|
|
|
void Intf_Interference::Insert(const Intf_SectionPoint& pdeb,
|
|
const Intf_SectionPoint& pfin)
|
|
{
|
|
Standard_Boolean Inserted=Standard_False;
|
|
Standard_Integer TheLS=0;
|
|
Standard_Boolean Begin=Standard_False;
|
|
Intf_SectionPoint TheBout(pfin);
|
|
Standard_Integer ils, nd, nf;
|
|
|
|
for (ils=1; ils<=mySLines.Length(); ils++) {
|
|
Intf_SectionLine& SL=mySLines(ils);
|
|
nd=SL.IsEnd(pdeb);
|
|
nf=SL.IsEnd(pfin);
|
|
if (nd==1) {
|
|
if (nf>1) SL.Close();
|
|
Inserted=Standard_True;
|
|
TheLS=ils;
|
|
Begin=Standard_True;
|
|
break;
|
|
}
|
|
else if (nd>1) {
|
|
if (nf==1) SL.Close();
|
|
Inserted=Standard_True;
|
|
TheLS=ils;
|
|
Begin=Standard_False;
|
|
break;
|
|
}
|
|
else if (nf==1) {
|
|
Inserted=Standard_True;
|
|
TheLS=ils;
|
|
Begin=Standard_True;
|
|
TheBout=pdeb;
|
|
break;
|
|
}
|
|
else if (nf>1) {
|
|
Inserted=Standard_True;
|
|
TheLS=ils;
|
|
Begin=Standard_False;
|
|
TheBout=pdeb;
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (!Inserted) {
|
|
Intf_SectionLine LaLS;
|
|
LaLS.Append(pdeb);
|
|
LaLS.Append(pfin);
|
|
mySLines.Append(LaLS);
|
|
}
|
|
else {
|
|
nd=0;
|
|
for (ils=1; ils<=mySLines.Length(); ils++) {
|
|
if (ils != TheLS) {
|
|
nd=mySLines(ils).IsEnd(TheBout);
|
|
if (nd==1) {
|
|
if (Begin) {
|
|
mySLines(TheLS).Reverse();
|
|
}
|
|
mySLines(ils).Prepend(mySLines(TheLS));
|
|
break;
|
|
}
|
|
else if (nd>1) {
|
|
if (!Begin) {
|
|
mySLines(TheLS).Reverse();
|
|
}
|
|
mySLines(ils).Append(mySLines(TheLS));
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
if (nd>0) {
|
|
mySLines.Remove(TheLS);
|
|
}
|
|
else {
|
|
if (Begin)
|
|
mySLines(TheLS).Prepend(TheBout);
|
|
else
|
|
mySLines(TheLS).Append(TheBout);
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
|
|
//----------------------------------------------------
|
|
//
|
|
//----------------------------------------------------
|
|
Standard_Boolean Intf_Interference::Contains
|
|
(const Intf_SectionPoint& LePnt) const
|
|
{
|
|
//-- LePnt.Dump(0);
|
|
for (Standard_Integer l=1; l<=mySLines.Length(); l++) {
|
|
if (mySLines(l).Contains(LePnt)) return Standard_True;
|
|
}
|
|
for (Standard_Integer t=1; t<=myTZones.Length(); t++) {
|
|
//-- myTZones(t).Dump(2);
|
|
if (myTZones(t).Contains(LePnt)) return Standard_True;
|
|
}
|
|
return Standard_False;
|
|
}
|
|
|
|
|
|
//----------------------------------------------------
|
|
//
|
|
//----------------------------------------------------
|
|
void Intf_Interference::Dump() const
|
|
{
|
|
cout << "Mes SectionPoint :" << endl;
|
|
for (Standard_Integer p=1; p<=mySPoins.Length(); p++) {
|
|
mySPoins(p).Dump(2);
|
|
}
|
|
cout << "Mes SectionLine :" << endl;
|
|
for (Standard_Integer l=1; l<=mySLines.Length(); l++) {
|
|
mySLines(l).Dump(2);
|
|
}
|
|
cout << "Mes TangentZone :" << endl;
|
|
for (Standard_Integer t=1; t<=myTZones.Length(); t++) {
|
|
myTZones(t).Dump(2);
|
|
}
|
|
}
|