mirror of
https://git.dev.opencascade.org/repos/occt.git
synced 2025-09-08 14:17:06 +03:00
Integration of OCCT 6.5.0 from SVN
This commit is contained in:
bugmaster
bugmaster
330
src/MAT2d/MAT2d_BisectingLocus.gxx
Executable file
330
src/MAT2d/MAT2d_BisectingLocus.gxx
Executable file
@@ -0,0 +1,330 @@
|
||||
// File: MAT2d_BisectingLocus.gxx
|
||||
// Created: Tue Jul 13 15:10:17 1993
|
||||
// Author: Yves FRICAUD
|
||||
// <yfr@phylox>
|
||||
|
||||
|
||||
# include <MAT2d_Mat2d.hxx>
|
||||
# include <MAT2d_Tool2d.hxx>
|
||||
# include <MAT2d_Circuit.hxx>
|
||||
# include <MAT2d_CutCurve.hxx>
|
||||
# include <MAT2d_BiInt.hxx>
|
||||
# include <MAT2d_SequenceOfSequenceOfGeometry.hxx>
|
||||
# include <MAT_Graph.hxx>
|
||||
# include <MAT_Arc.hxx>
|
||||
# include <MAT_BasicElt.hxx>
|
||||
# include <MAT_Node.hxx>
|
||||
# include <MAT_Bisector.hxx>
|
||||
# include <MAT_ListOfBisector.hxx>
|
||||
# include <MAT_DataMapOfIntegerBasicElt.hxx>
|
||||
# include <MAT_DataMapIteratorOfDataMapOfIntegerBasicElt.hxx>
|
||||
# include <Geom2d_Curve.hxx>
|
||||
# include <gp_Pnt2d.hxx>
|
||||
# include <TColGeom2d_SequenceOfGeometry.hxx>
|
||||
# include <Precision.hxx>
|
||||
|
||||
#include <Standard_OutOfRange.hxx>
|
||||
|
||||
static void CutSketch (MAT2d_SequenceOfSequenceOfGeometry& Figure,
|
||||
MAT2d_DataMapOfBiIntInteger& NbSect);
|
||||
|
||||
|
||||
//=============================================================================
|
||||
//function : MAT2d_BisectingLocus
|
||||
//purpose : Constructeur vide.
|
||||
//=============================================================================
|
||||
MAT2d_BisectingLocus::MAT2d_BisectingLocus()
|
||||
{
|
||||
}
|
||||
|
||||
|
||||
//=============================================================================
|
||||
//function : Compute
|
||||
//purpose : Calcul de la carte des lieux bisecteurs sur le contour defini par
|
||||
// <anExplo>.
|
||||
//=============================================================================
|
||||
void MAT2d_BisectingLocus::Compute( Explorer& anExplo,
|
||||
const Standard_Integer IndexLine,
|
||||
const MAT_Side aSide )
|
||||
{
|
||||
MAT2d_Mat2d TheMAT;
|
||||
Handle(MAT_ListOfBisector) TheRoots = new MAT_ListOfBisector();
|
||||
MAT2d_SequenceOfSequenceOfGeometry Figure;
|
||||
Standard_Integer i;
|
||||
|
||||
nbSect.Clear();
|
||||
nbContours = anExplo.NumberOfContours();
|
||||
|
||||
//---------------------------------
|
||||
// Lecture des donnees de anExplo.
|
||||
//---------------------------------
|
||||
for (i = 1; i <= anExplo.NumberOfContours(); i++) {
|
||||
TColGeom2d_SequenceOfGeometry Line;
|
||||
Figure.Append(Line);
|
||||
for (anExplo.Init(i); anExplo.More(); anExplo.Next()) {
|
||||
Figure.ChangeValue(i).Append(anExplo.Value());
|
||||
}
|
||||
}
|
||||
|
||||
//-----------------------
|
||||
// Decoupage des courbes.
|
||||
//-----------------------
|
||||
CutSketch(Figure,nbSect);
|
||||
|
||||
//----------------------------------------------------------
|
||||
// Construction du circuit sur lequel est calcule la carte.
|
||||
//----------------------------------------------------------
|
||||
Handle(MAT2d_Circuit) ACircuit = new MAT2d_Circuit();
|
||||
// Modified by Sergey KHROMOV - Wed Mar 6 17:43:47 2002 Begin
|
||||
// ACircuit->Perform(Figure,IndexLine,(aSide == MAT_Left));
|
||||
ACircuit->Perform(Figure,anExplo.GetIsClosed(), IndexLine,(aSide == MAT_Left));
|
||||
// Modified by Sergey KHROMOV - Wed Mar 6 17:43:48 2002 End
|
||||
|
||||
// -----------------------
|
||||
// Initialistion du Tool.
|
||||
// -----------------------
|
||||
theTool.Sense(aSide);
|
||||
theTool.InitItems(ACircuit);
|
||||
|
||||
// --------------------------------------------
|
||||
// Initialisation et execution de l algorithme.
|
||||
// --------------------------------------------
|
||||
TheMAT.CreateMat(theTool);
|
||||
|
||||
isDone = TheMAT.IsDone(); if (!isDone) return;
|
||||
|
||||
// ----------------------------------------------------------------
|
||||
// Recuperation du resultat de l algorithme et creation du graphe.
|
||||
// ----------------------------------------------------------------
|
||||
for (TheMAT.Init(); TheMAT.More(); TheMAT.Next()) {
|
||||
TheRoots->BackAdd(TheMAT.Bisector());
|
||||
}
|
||||
|
||||
theGraph = new MAT_Graph();
|
||||
theGraph->Perform(TheMAT.SemiInfinite(),
|
||||
TheRoots,
|
||||
theTool.NumberOfItems(),
|
||||
TheMAT.NumberOfBisectors());
|
||||
|
||||
//-----------------------------------------------------------------------
|
||||
// Fusion des elements de base doubles si plusieurs lignes dans Exploset.
|
||||
//-----------------------------------------------------------------------
|
||||
if (anExplo.NumberOfContours() > 1) {
|
||||
MAT_DataMapOfIntegerBasicElt NewMap;
|
||||
Standard_Integer IndexLast = 1;
|
||||
|
||||
//-----------------------------------------------------------------------
|
||||
// Construction de NewMap dont les elements sont ordonnes suivant les
|
||||
// lignes du contour et qui ne contient pas d element dupliques.
|
||||
// em meme temps fusion des arcs dupliques et mise a jour des noeuds.
|
||||
//-----------------------------------------------------------------------
|
||||
for ( i = 1; i <= anExplo.NumberOfContours(); i++) {
|
||||
RenumerationAndFusion(i,
|
||||
theTool.Circuit()->LineLength(i),
|
||||
IndexLast,
|
||||
NewMap);
|
||||
}
|
||||
|
||||
//-----------------------------------------------------------------------
|
||||
// Chargement dans le graph de la nouvelle map.
|
||||
// et compactage de la map des Arcs (ie Elimination des trous du a la
|
||||
// fusion d arcs ).et de celle des Nodes.
|
||||
//-----------------------------------------------------------------------
|
||||
theGraph->ChangeBasicElts(NewMap);
|
||||
theGraph->CompactArcs();
|
||||
theGraph->CompactNodes();
|
||||
}
|
||||
}
|
||||
|
||||
//=============================================================================
|
||||
//function : RenumerationAndFusion
|
||||
//purpose :
|
||||
//=============================================================================
|
||||
void MAT2d_BisectingLocus::RenumerationAndFusion
|
||||
(const Standard_Integer ILine,
|
||||
const Standard_Integer LengthLine,
|
||||
Standard_Integer& IndexLast,
|
||||
MAT_DataMapOfIntegerBasicElt& NewMap)
|
||||
{
|
||||
Standard_Integer IndFirst;
|
||||
Standard_Integer i,j;
|
||||
Standard_Integer GeomIndexArc1,GeomIndexArc2,GeomIndexArc3,GeomIndexArc4;
|
||||
Standard_Boolean MergeArc1,MergeArc2;
|
||||
|
||||
for ( i = 1; i <= LengthLine; i++) {
|
||||
const TColStd_SequenceOfInteger& S = theTool.Circuit()->RefToEqui(ILine,i);
|
||||
|
||||
IndFirst = S.Value(1);
|
||||
NewMap.Bind(IndexLast,theGraph->ChangeBasicElt(IndFirst));
|
||||
IndexLast++;
|
||||
|
||||
for(j = 2; j <= S.Length(); j++){
|
||||
theGraph->FusionOfBasicElts(IndFirst,
|
||||
S.Value(j),
|
||||
MergeArc1,
|
||||
GeomIndexArc1,
|
||||
GeomIndexArc2,
|
||||
MergeArc2,
|
||||
GeomIndexArc3,
|
||||
GeomIndexArc4);
|
||||
if(MergeArc1) {
|
||||
theTool.BisecFusion(GeomIndexArc1,GeomIndexArc2);
|
||||
}
|
||||
if(MergeArc2) {
|
||||
theTool.BisecFusion(GeomIndexArc3,GeomIndexArc4);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
//=============================================================================
|
||||
//function : IsDone
|
||||
//Purpose :
|
||||
//=============================================================================
|
||||
Standard_Boolean MAT2d_BisectingLocus::IsDone() const
|
||||
{
|
||||
return isDone;
|
||||
}
|
||||
|
||||
//=============================================================================
|
||||
//function : Graph
|
||||
//
|
||||
//=============================================================================
|
||||
Handle(MAT_Graph) MAT2d_BisectingLocus::Graph() const
|
||||
{
|
||||
return theGraph;
|
||||
}
|
||||
|
||||
//=============================================================================
|
||||
//function : NumberOfContours
|
||||
//
|
||||
//=============================================================================
|
||||
Standard_Integer MAT2d_BisectingLocus::NumberOfContours () const
|
||||
{
|
||||
return nbContours;
|
||||
}
|
||||
|
||||
//=============================================================================
|
||||
//function : NumberOfElts
|
||||
//
|
||||
//=============================================================================
|
||||
Standard_Integer MAT2d_BisectingLocus::NumberOfElts
|
||||
(const Standard_Integer IndLine) const
|
||||
{
|
||||
return theTool.Circuit()->LineLength(IndLine);
|
||||
}
|
||||
|
||||
//=============================================================================
|
||||
//function : NumberOfSect
|
||||
//
|
||||
//=============================================================================
|
||||
Standard_Integer MAT2d_BisectingLocus::NumberOfSections
|
||||
(const Standard_Integer IndLine,
|
||||
const Standard_Integer Index )
|
||||
const
|
||||
{
|
||||
MAT2d_BiInt B(IndLine,Index);
|
||||
return nbSect(B);
|
||||
}
|
||||
|
||||
//=============================================================================
|
||||
//function : BasicElt
|
||||
//
|
||||
//=============================================================================
|
||||
Handle(MAT_BasicElt) MAT2d_BisectingLocus::BasicElt
|
||||
(const Standard_Integer IndLine,
|
||||
const Standard_Integer Index )
|
||||
const
|
||||
{
|
||||
Standard_Integer i;
|
||||
Standard_Integer Ind = Index;
|
||||
|
||||
for (i = 1 ; i < IndLine ; i++){
|
||||
Ind = Ind + theTool.Circuit()->LineLength(i);
|
||||
}
|
||||
return theGraph->BasicElt(Ind);
|
||||
}
|
||||
|
||||
|
||||
//=============================================================================
|
||||
//function : GeomBis
|
||||
//
|
||||
//=============================================================================
|
||||
Bisector_Bisec MAT2d_BisectingLocus::GeomBis (const Handle(MAT_Arc)& anArc,
|
||||
Standard_Boolean& Reverse)
|
||||
const
|
||||
{
|
||||
Reverse = Standard_False;
|
||||
|
||||
Handle(Geom2d_Curve) Bis = theTool.GeomBis(anArc->GeomIndex()).Value();
|
||||
|
||||
if (Bis->FirstParameter() <= -Precision::Infinite()) {
|
||||
Reverse = Standard_True;
|
||||
}
|
||||
else if (Bis->LastParameter() < Precision::Infinite()) {
|
||||
gp_Pnt2d PF = Bis->Value(Bis->FirstParameter());
|
||||
gp_Pnt2d PL = Bis->Value(Bis->LastParameter());
|
||||
gp_Pnt2d PNode = GeomElt(anArc->FirstNode());
|
||||
if (PNode.SquareDistance(PF) > PNode.SquareDistance(PL))
|
||||
Reverse = Standard_True;
|
||||
}
|
||||
return theTool.GeomBis(anArc->GeomIndex());
|
||||
}
|
||||
|
||||
//=============================================================================
|
||||
//function : GeomElt
|
||||
//
|
||||
//=============================================================================
|
||||
Handle(Geom2d_Geometry) MAT2d_BisectingLocus::GeomElt
|
||||
(const Handle(MAT_BasicElt)& aBasicElt) const
|
||||
{
|
||||
return theTool.GeomElt(aBasicElt->GeomIndex());
|
||||
}
|
||||
|
||||
|
||||
//=============================================================================
|
||||
//function : GeomElt
|
||||
//
|
||||
//=============================================================================
|
||||
gp_Pnt2d MAT2d_BisectingLocus::GeomElt(const Handle(MAT_Node)& aNode) const
|
||||
{
|
||||
return theTool.GeomPnt(aNode->GeomIndex());
|
||||
}
|
||||
|
||||
|
||||
//=============================================================================
|
||||
//function : CutSketch
|
||||
//
|
||||
//=============================================================================
|
||||
static void CutSketch (MAT2d_SequenceOfSequenceOfGeometry& Figure,
|
||||
MAT2d_DataMapOfBiIntInteger& NbSect)
|
||||
{
|
||||
MAT2d_CutCurve Cuter;
|
||||
Standard_Integer i,j,k,ico;
|
||||
Standard_Integer ICurveInit;
|
||||
Standard_Integer NbSection;
|
||||
|
||||
for ( i = 1; i <= Figure.Length(); i++) {
|
||||
TColGeom2d_SequenceOfGeometry& Contour = Figure.ChangeValue(i);
|
||||
ICurveInit = 0;
|
||||
|
||||
for ( j = 1; j <= Contour.Length(); j++) {
|
||||
ICurveInit++;
|
||||
Cuter.Perform(Handle(Geom2d_Curve)::DownCast(Contour.ChangeValue(j)));
|
||||
NbSection = 1;
|
||||
if (!Cuter.UnModified()) {
|
||||
ico = j;
|
||||
NbSection = Cuter.NbCurves();
|
||||
for ( k = 1; k <= NbSection; k++) {
|
||||
Contour.InsertAfter(j,Cuter.Value(k));
|
||||
j++;
|
||||
}
|
||||
Contour.Remove(ico);
|
||||
j--;
|
||||
}
|
||||
MAT2d_BiInt B(i,ICurveInit);
|
||||
NbSect.Bind(B,NbSection);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user