OpenCascade/occt
1
0
Fork 0
mirror of https://git.dev.opencascade.org/repos/occt.git synced 2025-05-06 10:36:12 +03:00
Code
occt/src/Extrema/Extrema_GenExtPS.cxx
bugmaster b311480ed5 0023024: Update headers of OCCT files 
Added appropriate copyright and license information in source files
2012-03-21 19:43:04 +04:00

682 lines
21 KiB
C++
Executable File
Raw Blame History

// Created on: 1995-07-18
// Created by: Modelistation
// Copyright (c) 1995-1999 Matra Datavision
// Copyright (c) 1999-2012 OPEN CASCADE SAS
//
// The content of this file is subject to the Open CASCADE Technology Public
// License Version 6.5 (the "License"). You may not use the content of this file
// except in compliance with the License. Please obtain a copy of the License
// at http://www.opencascade.org and read it completely before using this file.
//
// The Initial Developer of the Original Code is Open CASCADE S.A.S., having its
// main offices at: 1, place des Freres Montgolfier, 78280 Guyancourt, France.
//
// The Original Code and all software distributed under the License is
// distributed on an "AS IS" basis, without warranty of any kind, and the
// Initial Developer hereby disclaims all such warranties, including without
// limitation, any warranties of merchantability, fitness for a particular
// purpose or non-infringement. Please see the License for the specific terms
// and conditions governing the rights and limitations under the License.
// Modified by skv - Thu Sep 30 15:21:07 2004 OCC593
#include <Extrema_GenExtPS.ixx>
#include <StdFail_NotDone.hxx>
#include <Standard_OutOfRange.hxx>
#include <TColStd_Array2OfInteger.hxx>
#include <TColStd_Array2OfReal.hxx>
#include <TColgp_Array2OfPnt.hxx>
#include <math_FunctionSetRoot.hxx>
#include <math_Vector.hxx>
#include <math_NewtonFunctionSetRoot.hxx>
#include <GeomAbs_IsoType.hxx>
#include <Bnd_Sphere.hxx>
#include <Extrema_HUBTreeOfSphere.hxx>
#include <Extrema_ExtFlag.hxx>
#include <Bnd_Array1OfSphere.hxx>
#include <Bnd_HArray1OfSphere.hxx>
//IMPLEMENT_HARRAY1(Extrema_HArray1OfSphere)
class Bnd_SphereUBTreeSelector : public Extrema_UBTreeOfSphere::Selector
{
public:
Bnd_SphereUBTreeSelector (const Handle(Bnd_HArray1OfSphere)& theSphereArray,
Bnd_Sphere& theSol)
: myXYZ(0,0,0),
mySphereArray(theSphereArray),
mySol(theSol)
{
//myXYZ = gp_Pnt(0, 0, 0);
}
void DefineCheckPoint( const gp_Pnt& theXYZ )
{ myXYZ = theXYZ; }
Bnd_Sphere& Sphere() const
{ return mySol; }
virtual Standard_Boolean Reject( const Bnd_Sphere &theBnd ) const = 0;
virtual Standard_Boolean Accept(const Standard_Integer& theObj) = 0;
protected:
gp_Pnt myXYZ;
const Handle(Bnd_HArray1OfSphere)& mySphereArray;
Bnd_Sphere& mySol;
};
class Bnd_SphereUBTreeSelectorMin : public Bnd_SphereUBTreeSelector
{
public:
Bnd_SphereUBTreeSelectorMin (const Handle(Bnd_HArray1OfSphere)& theSphereArray,
Bnd_Sphere& theSol)
: Bnd_SphereUBTreeSelector(theSphereArray, theSol),
myMinDist(RealLast())
{}
void SetMinDist( const Standard_Real theMinDist )
{ myMinDist = theMinDist; }
Standard_Real MinDist() const
{ return myMinDist; }
Standard_Boolean Reject( const Bnd_Sphere &theBnd ) const
{
Bnd_SphereUBTreeSelectorMin* me =
const_cast<Bnd_SphereUBTreeSelectorMin*>(this);
// myMinDist is decreased each time a nearer object is found
return theBnd.IsOut( myXYZ.XYZ(), me->myMinDist );
}
Standard_Boolean Accept(const Standard_Integer&);
private:
Standard_Real myMinDist;
};
Standard_Boolean Bnd_SphereUBTreeSelectorMin::Accept(const Standard_Integer& theInd)
{
const Bnd_Sphere& aSph = mySphereArray->Value(theInd);
Standard_Real aCurDist;
if ( (aCurDist = aSph.SquareDistance(myXYZ.XYZ())) < mySol.SquareDistance(myXYZ.XYZ()) )
{
mySol = aSph;
if ( aCurDist < myMinDist )
myMinDist = aCurDist;
return Standard_True;
}
return Standard_False;
}
class Bnd_SphereUBTreeSelectorMax : public Bnd_SphereUBTreeSelector
{
public:
Bnd_SphereUBTreeSelectorMax (const Handle(Bnd_HArray1OfSphere)& theSphereArray,
Bnd_Sphere& theSol)
: Bnd_SphereUBTreeSelector(theSphereArray, theSol),
myMaxDist(0)
{}
void SetMaxDist( const Standard_Real theMaxDist )
{ myMaxDist = theMaxDist; }
Standard_Real MaxDist() const
{ return myMaxDist; }
Standard_Boolean Reject( const Bnd_Sphere &theBnd ) const
{
Bnd_SphereUBTreeSelectorMax* me =
const_cast<Bnd_SphereUBTreeSelectorMax*>(this);
// myMaxDist is decreased each time a nearer object is found
return theBnd.IsOut( myXYZ.XYZ(), me->myMaxDist );
}
Standard_Boolean Accept(const Standard_Integer&);
private:
Standard_Real myMaxDist;
};
Standard_Boolean Bnd_SphereUBTreeSelectorMax::Accept(const Standard_Integer& theInd)
{
const Bnd_Sphere& aSph = mySphereArray->Value(theInd);
Standard_Real aCurDist;
if ( (aCurDist = aSph.SquareDistance(myXYZ.XYZ())) > mySol.SquareDistance(myXYZ.XYZ()) )
{
mySol = aSph;
if ( aCurDist > myMaxDist )
myMaxDist = aCurDist;
return Standard_True;
}
return Standard_False;
}
//=============================================================================
/*-----------------------------------------------------------------------------
Function:
Find all extremum distances between point P and surface
S using sampling (NbU,NbV).
Method:
The algorithm bases on the hypothesis that sampling is precise enough,
if there exist N extreme distances between the point and the surface,
so there also exist N extrema between the point and the grid.
So, the algorithm consists in starting from extrema of the grid to find the
extrema of the surface.
The extrema are calculated by the algorithm math_FunctionSetRoot with the
following arguments:
- F: Extrema_FuncExtPS created from P and S,
- UV: math_Vector the components which of are parameters of the extremum on the
grid,
- Tol: Min(TolU,TolV), (Prov.:math_FunctionSetRoot does not autorize a vector)
- UVinf: math_Vector the components which of are lower limits of u and v,
- UVsup: math_Vector the components which of are upper limits of u and v.
Processing:
a- Creation of the table of distances (TbDist(0,NbU+1,0,NbV+1)):
The table is expanded at will; lines 0 and NbU+1 and
columns 0 and NbV+1 are initialized at RealFirst() or RealLast()
to simplify the tests carried out at stage b
(there is no need to test if the point is on border of the grid).
b- Calculation of extrema:
First the minimums and then the maximums are found. These 2 procedured
pass in a similar way:
b.a- Initialization:
- 'borders' of table TbDist (RealLast() in case of minimums
and RealLast() in case of maximums),
- table TbSel(0,NbU+1,0,NbV+1) of selection of points for
calculation of local extremum (0). When a point will selected,
it will not be selectable, as well as the ajacent points
(8 at least). The corresponding addresses will be set to 1.
b.b- Calculation of minimums (or maximums):
All distances from table TbDist are parsed in a loop:
- search minimum (or maximum) in the grid,
- calculate extremum on the surface,
- update table TbSel.
-----------------------------------------------------------------------------*/
static Standard_Boolean IsoIsDeg (const Adaptor3d_Surface& S,
const Standard_Real Param,
const GeomAbs_IsoType IT,
const Standard_Real TolMin,
const Standard_Real TolMax)
{
Standard_Real U1=0.,U2=0.,V1=0.,V2=0.,T;
Standard_Boolean Along = Standard_True;
U1 = S.FirstUParameter();
U2 = S.LastUParameter();
V1 = S.FirstVParameter();
V2 = S.LastVParameter();
gp_Vec D1U,D1V;
gp_Pnt P;
Standard_Real Step,D1NormMax;
if (IT == GeomAbs_IsoV)
{
Step = (U2 - U1)/10;
D1NormMax=0.;
for (T=U1;T<=U2;T=T+Step)
{
S.D1(T,Param,P,D1U,D1V);
D1NormMax=Max(D1NormMax,D1U.Magnitude());
}
if (D1NormMax >TolMax || D1NormMax < TolMin )
Along = Standard_False;
}
else
{
Step = (V2 - V1)/10;
D1NormMax=0.;
for (T=V1;T<=V2;T=T+Step)
{
S.D1(Param,T,P,D1U,D1V);
D1NormMax=Max(D1NormMax,D1V.Magnitude());
}
if (D1NormMax >TolMax || D1NormMax < TolMin )
Along = Standard_False;
}
return Along;
}
//----------------------------------------------------------
Extrema_GenExtPS::Extrema_GenExtPS()
{
myDone = Standard_False;
myInit = Standard_False;
myFlag = Extrema_ExtFlag_MINMAX;
myAlgo = Extrema_ExtAlgo_Grad;
}
Extrema_GenExtPS::Extrema_GenExtPS (const gp_Pnt& P,
const Adaptor3d_Surface& S,
const Standard_Integer NbU,
const Standard_Integer NbV,
const Standard_Real TolU,
const Standard_Real TolV,
const Extrema_ExtFlag F,
const Extrema_ExtAlgo A)
: myF (P,S), myFlag(F), myAlgo(A)
{
Initialize(S, NbU, NbV, TolU, TolV);
Perform(P);
}
Extrema_GenExtPS::Extrema_GenExtPS (const gp_Pnt& P,
const Adaptor3d_Surface& S,
const Standard_Integer NbU,
const Standard_Integer NbV,
const Standard_Real Umin,
const Standard_Real Usup,
const Standard_Real Vmin,
const Standard_Real Vsup,
const Standard_Real TolU,
const Standard_Real TolV,
const Extrema_ExtFlag F,
const Extrema_ExtAlgo A)
: myF (P,S), myFlag(F), myAlgo(A)
{
Initialize(S, NbU, NbV, Umin, Usup, Vmin, Vsup, TolU, TolV);
Perform(P);
}
void Extrema_GenExtPS::Initialize(const Adaptor3d_Surface& S,
const Standard_Integer NbU,
const Standard_Integer NbV,
const Standard_Real TolU,
const Standard_Real TolV)
{
myumin = S.FirstUParameter();
myusup = S.LastUParameter();
myvmin = S.FirstVParameter();
myvsup = S.LastVParameter();
Initialize(S,NbU,NbV,myumin,myusup,myvmin,myvsup,TolU,TolV);
}
void Extrema_GenExtPS::Initialize(const Adaptor3d_Surface& S,
const Standard_Integer NbU,
const Standard_Integer NbV,
const Standard_Real Umin,
const Standard_Real Usup,
const Standard_Real Vmin,
const Standard_Real Vsup,
const Standard_Real TolU,
const Standard_Real TolV)
{
myInit = Standard_True;
myS = (Adaptor3d_SurfacePtr)&S;
myusample = NbU;
myvsample = NbV;
mytolu = TolU;
mytolv = TolV;
myumin = Umin;
myusup = Usup;
myvmin = Vmin;
myvsup = Vsup;
if ((myusample < 2) ||
(myvsample < 2)) { Standard_OutOfRange::Raise(); }
myF.Initialize(S);
mySphereUBTree.Nullify();
if(myAlgo == Extrema_ExtAlgo_Grad)
{
//If flag was changed and extrema not reinitialized Extrema would fail
mypoints = new TColgp_HArray2OfPnt(0,myusample+1,0,myvsample+1);
Standard_Real PasU = myusup - myumin;
Standard_Real PasV = myvsup - myvmin;
Standard_Real U0 = PasU / myusample / 100.;
Standard_Real V0 = PasV / myvsample / 100.;
gp_Pnt P1;
PasU = (PasU - U0) / (myusample - 1);
PasV = (PasV - V0) / (myvsample - 1);
U0 = U0/2. + myumin;
V0 = V0/2. + myvmin;
// Calculation of distances
Standard_Integer NoU, NoV;
Standard_Real U, V;
for ( NoU = 1, U = U0; NoU <= myusample; NoU++, U += PasU) {
for ( NoV = 1, V = V0; NoV <= myvsample; NoV++, V += PasV) {
P1 = myS->Value(U, V);
mypoints->SetValue(NoU,NoV,P1);
}
}
}
//mypoints = new TColgp_HArray2OfPnt(0,myusample+1,0,myvsample+1);
/*
a- Constitution of the table of distances (TbDist(0,myusample+1,0,myvsample+1)):
---------------------------------------------------------------
*/
// Parameterisation of the sample
}
void Extrema_GenExtPS::BuildTree()
{
// if tree already exists, assume it is already correctly filled
if ( ! mySphereUBTree.IsNull() )
return;
Standard_Real PasU = myusup - myumin;
Standard_Real PasV = myvsup - myvmin;
Standard_Real U0 = PasU / myusample / 100.;
Standard_Real V0 = PasV / myvsample / 100.;
gp_Pnt P1;
PasU = (PasU - U0) / (myusample - 1);
PasV = (PasV - V0) / (myvsample - 1);
U0 = U0/2. + myumin;
V0 = V0/2. + myvmin;
// Calculation of distances
mySphereUBTree = new Extrema_UBTreeOfSphere;
Extrema_UBTreeFillerOfSphere aFiller(*mySphereUBTree);
Standard_Integer i = 0;
Standard_Real U, V;
mySphereArray = new Bnd_HArray1OfSphere(0, myusample * myvsample);
Standard_Integer NoU, NoV;
for ( NoU = 1, U = U0; NoU <= myusample; NoU++, U += PasU) {
for ( NoV = 1, V = V0; NoV <= myvsample; NoV++, V += PasV) {
P1 = myS->Value(U, V);
Bnd_Sphere aSph(P1.XYZ(), 0/*mytolu < mytolv ? mytolu : mytolv*/, NoU, NoV);
aFiller.Add(i, aSph);
mySphereArray->SetValue( i, aSph );
i++;
}
}
aFiller.Fill();
}
void Extrema_GenExtPS::FindSolution(const gp_Pnt& P, const math_Vector& UV, const Standard_Real PasU, const Standard_Real PasV, const Extrema_ExtFlag f)
{
math_Vector Tol(1,2);
Tol(1) = mytolu;
Tol(2) = mytolv;
math_Vector UVinf(1,2), UVsup(1,2);
UVinf(1) = myumin;
UVinf(2) = myvmin;
UVsup(1) = myusup;
UVsup(2) = myvsup;
math_Vector errors(1,2);
math_Vector root(1, 2);
Standard_Real eps = 1.e-9;
Standard_Integer nbsubsample = 11;
Standard_Integer aNbMaxIter = 100;
gp_Pnt PStart = myS->Value(UV(1), UV(2));
Standard_Real DistStart = P.SquareDistance(PStart);
Standard_Real DistSol = DistStart;
math_FunctionSetRoot S (myF,UV,Tol,UVinf,UVsup, aNbMaxIter);
Standard_Boolean ToResolveOnSubgrid = Standard_False;
if (f == Extrema_ExtFlag_MIN)
{
if(S.IsDone())
{
root = S.Root();
myF.Value(root, errors);
gp_Pnt PSol = myS->Value(root(1), root(2));
DistSol = P.SquareDistance(PSol);
if(Abs(errors(1)) > eps || Abs(errors(2)) > eps || DistStart < DistSol)
//try to improve solution on subgrid of sample points
ToResolveOnSubgrid = Standard_True;
}
else
ToResolveOnSubgrid = Standard_True;
if (ToResolveOnSubgrid)
{
Standard_Real u1 = Max(UV(1) - PasU, myumin), u2 = Min(UV(1) + PasU, myusup);
Standard_Real v1 = Max(UV(2) - PasV, myvmin), v2 = Min(UV(2) + PasV, myvsup);
if(u2 - u1 < 2.*PasU) {
if(Abs(u1 - myumin) < 1.e-9) {
u2 = u1 + 2.*PasU;
u2 = Min(u2, myusup);
}
if(Abs(u2 - myusup) < 1.e-9) {
u1 = u2 - 2.*PasU;
u1 = Max(u1, myumin);
}
}
if(v2 - v1 < 2.*PasV) {
if(Abs(v1 - myvmin) < 1.e-9) {
v2 = v1 + 2.*PasV;
v2 = Min(v2, myvsup);
}
if(Abs(v2 - myvsup) < 1.e-9) {
v1 = v2 - 2.*PasV;
v1 = Max(v1, myvmin);
}
}
Standard_Real du = (u2 - u1)/(nbsubsample-1);
Standard_Real dv = (v2 - v1)/(nbsubsample-1);
Standard_Real u, v;
Standard_Real dist;
Standard_Boolean NewSolution = Standard_False;
Standard_Integer Nu, Nv;
for (Nu = 1, u = u1; Nu < nbsubsample; Nu++, u += du) {
for (Nv = 1, v = v1; Nv < nbsubsample; Nv++, v += dv) {
gp_Pnt Puv = myS->Value(u, v);
dist = P.SquareDistance(Puv);
if(dist < DistSol) {
UV(1) = u;
UV(2) = v;
NewSolution = Standard_True;
DistSol = dist;
}
}
}
if(NewSolution) {
//try to precise
math_FunctionSetRoot S (myF,UV,Tol,UVinf,UVsup, aNbMaxIter);
}
} //end of if (ToResolveOnSubgrid)
} //end of if (f == Extrema_ExtFlag_MIN)
myDone = Standard_True;
}
void Extrema_GenExtPS::SetFlag(const Extrema_ExtFlag F)
{
myFlag = F;
}
void Extrema_GenExtPS::SetAlgo(const Extrema_ExtAlgo A)
{
myAlgo = A;
}
void Extrema_GenExtPS::Perform(const gp_Pnt& P)
{
//BuildTree();
myDone = Standard_False;
myF.SetPoint(P);
Standard_Real PasU = myusup - myumin;
Standard_Real PasV = myvsup - myvmin;
Standard_Real U, U0 = PasU / myusample / 100.;
Standard_Real V, V0 = PasV / myvsample / 100.;
PasU = (PasU - U0) / (myusample - 1);
PasV = (PasV - V0) / (myvsample - 1);
U0 = U0/2.+myumin;
V0 = V0/2.+myvmin;
//math_Vector Tol(1, 2);
math_Vector UV(1,2);
if(myAlgo == Extrema_ExtAlgo_Grad)
{
Standard_Integer NoU,NoV;
TColStd_Array2OfReal TheDist(0, myusample+1, 0, myvsample+1);
for ( NoU = 1, U = U0; NoU <= myusample; NoU++, U += PasU) {
for ( NoV = 1, V = V0; NoV <= myvsample; NoV++, V += PasV) {
TheDist(NoU, NoV) = P.SquareDistance(mypoints->Value(NoU, NoV));
}
}
TColStd_Array2OfInteger TbSel(0,myusample+1,0,myvsample+1);
TbSel.Init(0);
Standard_Real Dist;
if(myFlag == Extrema_ExtFlag_MIN || myFlag == Extrema_ExtFlag_MINMAX)
{
for (NoV = 0; NoV <= myvsample+1; NoV++) {
TheDist(0,NoV) = RealLast();
TheDist(myusample+1,NoV) = RealLast();
}
for (NoU = 1; NoU <= myusample; NoU++) {
TheDist(NoU,0) = RealLast();
TheDist(NoU,myvsample+1) = RealLast();
}
for (NoU = 1; NoU <= myusample; NoU++) {
for (NoV = 1; NoV <= myvsample; NoV++) {
if (TbSel(NoU,NoV) == 0) {
Dist = TheDist(NoU,NoV);
if ((TheDist(NoU-1,NoV-1) >= Dist) &&
(TheDist(NoU-1,NoV ) >= Dist) &&
(TheDist(NoU-1,NoV+1) >= Dist) &&
(TheDist(NoU ,NoV-1) >= Dist) &&
(TheDist(NoU ,NoV+1) >= Dist) &&
(TheDist(NoU+1,NoV-1) >= Dist) &&
(TheDist(NoU+1,NoV ) >= Dist) &&
(TheDist(NoU+1,NoV+1) >= Dist)) {
//Create array of UV vectors to calculate min
UV(1) = U0 + (NoU - 1) * PasU;
UV(2) = V0 + (NoV - 1) * PasV;
FindSolution(P, UV, PasU, PasV, Extrema_ExtFlag_MIN);
}
}
}
}
}
if(myFlag == Extrema_ExtFlag_MAX || myFlag == Extrema_ExtFlag_MINMAX)
{
for (NoV = 0; NoV <= myvsample+1; NoV++) {
TheDist(0,NoV) = RealFirst();
TheDist(myusample+1,NoV) = RealFirst();
}
for (NoU = 1; NoU <= myusample; NoU++) {
TheDist(NoU,0) = RealFirst();
TheDist(NoU,myvsample+1) = RealFirst();
}
for (NoU = 1; NoU <= myusample; NoU++) {
for (NoV = 1; NoV <= myvsample; NoV++) {
if (TbSel(NoU,NoV) == 0) {
Dist = TheDist(NoU,NoV);
if ((TheDist(NoU-1,NoV-1) <= Dist) &&
(TheDist(NoU-1,NoV ) <= Dist) &&
(TheDist(NoU-1,NoV+1) <= Dist) &&
(TheDist(NoU ,NoV-1) <= Dist) &&
(TheDist(NoU ,NoV+1) <= Dist) &&
(TheDist(NoU+1,NoV-1) <= Dist) &&
(TheDist(NoU+1,NoV ) <= Dist) &&
(TheDist(NoU+1,NoV+1) <= Dist)) {
//Create array of UV vectors to calculate max
UV(1) = U0 + (NoU - 1) * PasU;
UV(2) = V0 + (NoV - 1) * PasV;
FindSolution(P, UV, PasU, PasV, Extrema_ExtFlag_MAX);
}
}
}
}
}
}
else
{
BuildTree();
if(myFlag == Extrema_ExtFlag_MIN || myFlag == Extrema_ExtFlag_MINMAX)
{
Bnd_Sphere aSol = mySphereArray->Value(0);
Bnd_SphereUBTreeSelectorMin aSelector(mySphereArray, aSol);
//aSelector.SetMaxDist( RealLast() );
aSelector.DefineCheckPoint( P );
Standard_Integer aNbSel = mySphereUBTree->Select( aSelector );
//TODO: check if no solution in binary tree
Bnd_Sphere& aSph = aSelector.Sphere();
UV(1) = U0 + (aSph.U() - 1) * PasU;
UV(2) = V0 + (aSph.V() - 1) * PasV;
FindSolution(P, UV, PasU, PasV, Extrema_ExtFlag_MIN);
}
if(myFlag == Extrema_ExtFlag_MAX || myFlag == Extrema_ExtFlag_MINMAX)
{
Bnd_Sphere aSol = mySphereArray->Value(0);
Bnd_SphereUBTreeSelectorMax aSelector(mySphereArray, aSol);
//aSelector.SetMaxDist( RealLast() );
aSelector.DefineCheckPoint( P );
Standard_Integer aNbSel = mySphereUBTree->Select( aSelector );
//TODO: check if no solution in binary tree
Bnd_Sphere& aSph = aSelector.Sphere();
UV(1) = U0 + (aSph.U() - 1) * PasU;
UV(2) = V0 + (aSph.V() - 1) * PasV;
FindSolution(P, UV, PasU, PasV, Extrema_ExtFlag_MAX);
}
}
}
//=============================================================================
Standard_Boolean Extrema_GenExtPS::IsDone () const { return myDone; }
//=============================================================================
Standard_Integer Extrema_GenExtPS::NbExt () const
{
if (!IsDone()) { StdFail_NotDone::Raise(); }
return myF.NbExt();
}
//=============================================================================
Standard_Real Extrema_GenExtPS::SquareDistance (const Standard_Integer N) const
{
if (!IsDone()) { StdFail_NotDone::Raise(); }
return myF.SquareDistance(N);
}
//=============================================================================
Extrema_POnSurf Extrema_GenExtPS::Point (const Standard_Integer N) const
{
if (!IsDone()) { StdFail_NotDone::Raise(); }
return myF.Point(N);
}
//=============================================================================
View Git Blame Copy Permalink