2009-02-17 10:27:49 +05:00
|
|
|
// Copyright (C) 2007-2008 CEA/DEN, EDF R&D, OPEN CASCADE
|
|
|
|
//
|
|
|
|
// Copyright (C) 2003-2007 OPEN CASCADE, EADS/CCR, LIP6, CEA/DEN,
|
|
|
|
// CEDRAT, EDF R&D, LEG, PRINCIPIA R&D, BUREAU VERITAS
|
2008-03-07 12:47:05 +05:00
|
|
|
//
|
2009-02-17 10:27:49 +05:00
|
|
|
// This library is free software; you can redistribute it and/or
|
|
|
|
// modify it under the terms of the GNU Lesser General Public
|
|
|
|
// License as published by the Free Software Foundation; either
|
|
|
|
// version 2.1 of the License.
|
2008-03-07 12:47:05 +05:00
|
|
|
//
|
2009-02-17 10:27:49 +05:00
|
|
|
// This library is distributed in the hope that it will be useful,
|
|
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
|
|
// Lesser General Public License for more details.
|
2008-03-07 12:47:05 +05:00
|
|
|
//
|
2009-02-17 10:27:49 +05:00
|
|
|
// You should have received a copy of the GNU Lesser General Public
|
|
|
|
// License along with this library; if not, write to the Free Software
|
|
|
|
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
2008-03-07 12:47:05 +05:00
|
|
|
//
|
2009-02-17 10:27:49 +05:00
|
|
|
// See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
|
|
|
|
//
|
|
|
|
// SMESH SMESH : implementaion of SMESH idl descriptions
|
2008-03-07 12:47:05 +05:00
|
|
|
// File : StdMeshers_FaceSide.hxx
|
|
|
|
// Created : Wed Jan 31 18:41:25 2007
|
|
|
|
// Author : Edward AGAPOV (eap)
|
|
|
|
// Module : SMESH
|
2009-02-17 10:27:49 +05:00
|
|
|
//
|
2008-03-07 12:47:05 +05:00
|
|
|
#include "StdMeshers_FaceSide.hxx"
|
|
|
|
|
|
|
|
#include "SMDS_EdgePosition.hxx"
|
|
|
|
#include "SMDS_MeshNode.hxx"
|
|
|
|
#include "SMESHDS_Mesh.hxx"
|
|
|
|
#include "SMESHDS_SubMesh.hxx"
|
|
|
|
//#include "SMESH_Algo.hxx"
|
|
|
|
#include "SMESH_Mesh.hxx"
|
2009-05-19 21:23:46 +06:00
|
|
|
#include "SMESH_MesherHelper.hxx"
|
2008-03-07 12:47:05 +05:00
|
|
|
#include "SMESH_ComputeError.hxx"
|
|
|
|
#include "SMESH_Block.hxx"
|
|
|
|
|
|
|
|
#include <Adaptor2d_Curve2d.hxx>
|
|
|
|
#include <BRepAdaptor_CompCurve.hxx>
|
|
|
|
#include <BRepAdaptor_Curve.hxx>
|
|
|
|
#include <BRep_Builder.hxx>
|
|
|
|
#include <BRep_Tool.hxx>
|
|
|
|
#include <TopExp.hxx>
|
2009-02-17 10:27:49 +05:00
|
|
|
#include <TopExp_Explorer.hxx>
|
2008-03-07 12:47:05 +05:00
|
|
|
#include <TopoDS_Face.hxx>
|
|
|
|
#include <TopoDS_Vertex.hxx>
|
|
|
|
#include <TopoDS_Wire.hxx>
|
|
|
|
|
|
|
|
#include <map>
|
|
|
|
|
|
|
|
#include "utilities.h"
|
|
|
|
|
|
|
|
//================================================================================
|
|
|
|
/*!
|
|
|
|
* \brief Constructor of a side of one edge
|
|
|
|
* \param theFace - the face
|
|
|
|
* \param theEdge - the edge
|
|
|
|
*/
|
|
|
|
//================================================================================
|
|
|
|
|
|
|
|
StdMeshers_FaceSide::StdMeshers_FaceSide(const TopoDS_Face& theFace,
|
|
|
|
const TopoDS_Edge& theEdge,
|
|
|
|
SMESH_Mesh* theMesh,
|
|
|
|
const bool theIsForward,
|
|
|
|
const bool theIgnoreMediumNodes)
|
|
|
|
{
|
|
|
|
list<TopoDS_Edge> edges(1,theEdge);
|
|
|
|
*this = StdMeshers_FaceSide( theFace, edges, theMesh, theIsForward, theIgnoreMediumNodes );
|
|
|
|
}
|
|
|
|
|
|
|
|
//================================================================================
|
|
|
|
/*!
|
|
|
|
* \brief Constructor of a side of several edges
|
|
|
|
* \param theFace - the face
|
|
|
|
* \param theEdge - the edge
|
|
|
|
*/
|
|
|
|
//================================================================================
|
|
|
|
|
|
|
|
StdMeshers_FaceSide::StdMeshers_FaceSide(const TopoDS_Face& theFace,
|
|
|
|
list<TopoDS_Edge>& theEdges,
|
|
|
|
SMESH_Mesh* theMesh,
|
|
|
|
const bool theIsForward,
|
|
|
|
const bool theIgnoreMediumNodes)
|
|
|
|
{
|
|
|
|
int nbEdges = theEdges.size();
|
|
|
|
myEdge.resize( nbEdges );
|
|
|
|
myC2d.resize( nbEdges );
|
|
|
|
myFirst.resize( nbEdges );
|
|
|
|
myLast.resize( nbEdges );
|
|
|
|
myNormPar.resize( nbEdges );
|
|
|
|
myLength = 0;
|
|
|
|
myNbPonits = myNbSegments = 0;
|
|
|
|
myMesh = theMesh;
|
|
|
|
myMissingVertexNodes = false;
|
|
|
|
myIgnoreMediumNodes = theIgnoreMediumNodes;
|
|
|
|
if ( nbEdges == 0 ) return;
|
|
|
|
|
|
|
|
SMESHDS_Mesh* meshDS = theMesh->GetMeshDS();
|
|
|
|
vector<double> len( nbEdges );
|
|
|
|
|
|
|
|
int nbDegen = 0;
|
|
|
|
list<TopoDS_Edge>::iterator edge = theEdges.begin();
|
|
|
|
for ( int index = 0; edge != theEdges.end(); ++index, ++edge )
|
|
|
|
{
|
|
|
|
int i = theIsForward ? index : nbEdges - index - 1;
|
|
|
|
len[i] = SMESH_Algo::EdgeLength( *edge );
|
|
|
|
if ( len[i] < DBL_MIN ) nbDegen++;
|
|
|
|
myLength += len[i];
|
|
|
|
myEdge[i] = *edge;
|
|
|
|
if ( !theIsForward ) myEdge[i].Reverse();
|
|
|
|
|
|
|
|
if ( theFace.IsNull() )
|
|
|
|
BRep_Tool::Range( *edge, myFirst[i], myLast[i] );
|
|
|
|
else
|
|
|
|
myC2d[i] = BRep_Tool::CurveOnSurface( *edge, theFace, myFirst[i], myLast[i] );
|
|
|
|
if ( myEdge[i].Orientation() == TopAbs_REVERSED )
|
|
|
|
std::swap( myFirst[i], myLast[i] );
|
|
|
|
|
|
|
|
if ( SMESHDS_SubMesh* sm = meshDS->MeshElements( *edge )) {
|
|
|
|
int nbN = sm->NbNodes();
|
|
|
|
if ( theIgnoreMediumNodes ) {
|
|
|
|
SMDS_ElemIteratorPtr elemIt = sm->GetElements();
|
|
|
|
if ( elemIt->more() && elemIt->next()->IsQuadratic() )
|
|
|
|
nbN -= sm->NbElements();
|
|
|
|
}
|
|
|
|
myNbPonits += nbN;
|
|
|
|
myNbSegments += sm->NbElements();
|
|
|
|
}
|
|
|
|
if ( SMESH_Algo::VertexNode( TopExp::FirstVertex( *edge, 1), meshDS ))
|
|
|
|
myNbPonits += 1; // for the first end
|
|
|
|
else
|
|
|
|
myMissingVertexNodes = true;
|
|
|
|
}
|
|
|
|
if ( SMESH_Algo::VertexNode( TopExp::LastVertex( theEdges.back(), 1), meshDS ))
|
|
|
|
myNbPonits++; // for the last end
|
|
|
|
else
|
|
|
|
myMissingVertexNodes = true;
|
|
|
|
|
|
|
|
if ( nbEdges > 1 && myLength > DBL_MIN ) {
|
|
|
|
const double degenNormLen = 1.e-5;
|
|
|
|
double totLength = myLength;
|
|
|
|
if ( nbDegen )
|
|
|
|
totLength += myLength * degenNormLen * nbDegen;
|
|
|
|
double prevNormPar = 0;
|
|
|
|
for ( int i = 0; i < nbEdges; ++i ) {
|
|
|
|
if ( len[ i ] < DBL_MIN )
|
|
|
|
len[ i ] = myLength * degenNormLen;
|
|
|
|
myNormPar[ i ] = prevNormPar + len[i]/totLength;
|
|
|
|
prevNormPar = myNormPar[ i ];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
myNormPar[nbEdges-1] = 1.;
|
|
|
|
//dump();
|
|
|
|
}
|
|
|
|
|
|
|
|
//================================================================================
|
|
|
|
/*!
|
|
|
|
* \brief Return info on nodes on the side
|
|
|
|
* \retval UVPtStruct* - array of data structures
|
|
|
|
*/
|
|
|
|
//================================================================================
|
|
|
|
|
|
|
|
const vector<UVPtStruct>& StdMeshers_FaceSide::GetUVPtStruct(bool isXConst,
|
|
|
|
double constValue) const
|
|
|
|
{
|
|
|
|
if ( myPoints.empty() ) {
|
|
|
|
|
|
|
|
if ( NbEdges() == 0 ) return myPoints;
|
|
|
|
|
|
|
|
SMESHDS_Mesh* meshDS = myMesh->GetMeshDS();
|
|
|
|
|
|
|
|
// sort nodes of all edges putting them into a map
|
|
|
|
|
|
|
|
map< double, const SMDS_MeshNode*> u2node;
|
|
|
|
//int nbOnDegen = 0;
|
|
|
|
for ( int i = 0; i < myEdge.size(); ++i )
|
|
|
|
{
|
|
|
|
// put 1st vertex node
|
|
|
|
TopoDS_Vertex VFirst, VLast;
|
|
|
|
TopExp::Vertices( myEdge[i], VFirst, VLast, true);
|
|
|
|
const SMDS_MeshNode* node = SMESH_Algo::VertexNode( VFirst, meshDS );
|
|
|
|
double prevNormPar = ( i == 0 ? 0 : myNormPar[ i-1 ]); // normalized param
|
|
|
|
if ( node ) { // internal nodes may be missing
|
|
|
|
u2node.insert( make_pair( prevNormPar, node ));
|
|
|
|
} else if ( i == 0 ) {
|
|
|
|
MESSAGE(" NO NODE on VERTEX" );
|
|
|
|
return myPoints;
|
|
|
|
}
|
|
|
|
|
|
|
|
// put 2nd vertex node for a last edge
|
|
|
|
if ( i+1 == myEdge.size() ) {
|
|
|
|
node = SMESH_Algo::VertexNode( VLast, meshDS );
|
|
|
|
if ( !node ) {
|
|
|
|
MESSAGE(" NO NODE on VERTEX" );
|
|
|
|
return myPoints;
|
|
|
|
}
|
|
|
|
u2node.insert( make_pair( 1., node ));
|
|
|
|
}
|
|
|
|
|
|
|
|
// put internal nodes
|
|
|
|
SMESHDS_SubMesh* sm = meshDS->MeshElements( myEdge[i] );
|
|
|
|
if ( !sm ) continue;
|
|
|
|
SMDS_NodeIteratorPtr nItr = sm->GetNodes();
|
|
|
|
double paramSize = myLast[i] - myFirst[i], r = myNormPar[i] - prevNormPar;
|
|
|
|
while ( nItr->more() ) {
|
|
|
|
const SMDS_MeshNode* node = nItr->next();
|
|
|
|
if ( myIgnoreMediumNodes && SMESH_MeshEditor::IsMedium( node, SMDSAbs_Edge ))
|
|
|
|
continue;
|
|
|
|
const SMDS_EdgePosition* epos =
|
|
|
|
static_cast<const SMDS_EdgePosition*>(node->GetPosition().get());
|
|
|
|
double u = epos->GetUParameter();
|
|
|
|
// paramSize is signed so orientation is taken into account
|
|
|
|
double normPar = prevNormPar + r * ( u - myFirst[i] ) / paramSize;
|
|
|
|
#ifdef _DEBUG_
|
|
|
|
if ( normPar > 1 || normPar < 0) {
|
|
|
|
dump("DEBUG");
|
2009-02-17 10:27:49 +05:00
|
|
|
MESSAGE ( "WRONG normPar: "<<normPar<< " prevNormPar="<<prevNormPar
|
|
|
|
<< " u="<<u << " myFirst[i]="<<myFirst[i]<< " myLast[i]="<<myLast[i]
|
|
|
|
<< " paramSize="<<paramSize );
|
2008-03-07 12:47:05 +05:00
|
|
|
}
|
|
|
|
#endif
|
|
|
|
u2node.insert( make_pair( normPar, node ));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if ( u2node.size() != myNbPonits ) {
|
|
|
|
MESSAGE("Wrong node parameters on edges, u2node.size():"
|
|
|
|
<<u2node.size()<<" != myNbPonits:"<<myNbPonits);
|
|
|
|
return myPoints;
|
|
|
|
}
|
|
|
|
|
|
|
|
// fill array of UVPtStruct
|
|
|
|
|
|
|
|
vector<uvPtStruct>* points = const_cast<vector<uvPtStruct>*>( &myPoints );
|
|
|
|
points->resize( myNbPonits );
|
|
|
|
|
|
|
|
int EdgeIndex = 0;
|
|
|
|
double prevNormPar = 0, paramSize = myNormPar[ EdgeIndex ];
|
|
|
|
map< double, const SMDS_MeshNode*>::iterator u_node = u2node.begin();
|
|
|
|
for (int i = 0 ; u_node != u2node.end(); ++u_node, ++i ) {
|
|
|
|
UVPtStruct & uvPt = (*points)[i];
|
|
|
|
uvPt.node = u_node->second;
|
|
|
|
uvPt.x = uvPt.y = uvPt.normParam = u_node->first;
|
|
|
|
if ( isXConst ) uvPt.x = constValue;
|
|
|
|
else uvPt.y = constValue;
|
|
|
|
if ( myNormPar[ EdgeIndex ] < uvPt.normParam ) {
|
|
|
|
prevNormPar = myNormPar[ EdgeIndex ];
|
|
|
|
++EdgeIndex;
|
|
|
|
#ifdef _DEBUG_
|
|
|
|
if ( EdgeIndex >= myEdge.size() ) {
|
|
|
|
dump("DEBUG");
|
2009-02-17 10:27:49 +05:00
|
|
|
MESSAGE ( "WRONg EdgeIndex " << 1+EdgeIndex
|
|
|
|
<< " myNormPar.size()="<<myNormPar.size()
|
|
|
|
<< " myNormPar["<< EdgeIndex<<"]="<< myNormPar[ EdgeIndex ]
|
|
|
|
<< " uvPt.normParam="<<uvPt.normParam );
|
2008-03-07 12:47:05 +05:00
|
|
|
}
|
|
|
|
#endif
|
|
|
|
paramSize = myNormPar[ EdgeIndex ] - prevNormPar;
|
|
|
|
}
|
|
|
|
const SMDS_EdgePosition* epos =
|
|
|
|
dynamic_cast<const SMDS_EdgePosition*>(uvPt.node->GetPosition().get());
|
|
|
|
if ( epos ) {
|
|
|
|
uvPt.param = epos->GetUParameter();
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
double r = ( uvPt.normParam - prevNormPar )/ paramSize;
|
|
|
|
// uvPt.param = myFirst[EdgeIndex] * ( 1 - r ) + myLast[EdgeIndex] * r;
|
|
|
|
uvPt.param = ( r > 0.5 ? myLast[EdgeIndex] : myFirst[EdgeIndex] );
|
|
|
|
}
|
|
|
|
if ( !myC2d[ EdgeIndex ].IsNull() ) {
|
|
|
|
gp_Pnt2d p = myC2d[ EdgeIndex ]->Value( uvPt.param );
|
|
|
|
uvPt.u = p.X();
|
|
|
|
uvPt.v = p.Y();
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
uvPt.u = uvPt.v = 1e+100;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return myPoints;
|
|
|
|
}
|
|
|
|
|
|
|
|
//================================================================================
|
|
|
|
/*!
|
|
|
|
* \brief Falsificate info on nodes
|
|
|
|
* \param nbSeg - nb of segments on the side
|
|
|
|
* \retval UVPtStruct* - array of data structures
|
|
|
|
*/
|
|
|
|
//================================================================================
|
|
|
|
|
|
|
|
const vector<UVPtStruct>& StdMeshers_FaceSide::SimulateUVPtStruct(int nbSeg,
|
|
|
|
bool isXConst,
|
|
|
|
double constValue) const
|
|
|
|
{
|
|
|
|
if ( myFalsePoints.empty() ) {
|
|
|
|
|
|
|
|
if ( NbEdges() == 0 ) return myFalsePoints;
|
|
|
|
|
|
|
|
vector<uvPtStruct>* points = const_cast<vector<uvPtStruct>*>( &myFalsePoints );
|
|
|
|
points->resize( nbSeg+1 );
|
|
|
|
|
|
|
|
int EdgeIndex = 0;
|
|
|
|
double prevNormPar = 0, paramSize = myNormPar[ EdgeIndex ];
|
|
|
|
for (int i = 0 ; i < myFalsePoints.size(); ++i ) {
|
|
|
|
double normPar = double(i) / double(nbSeg);
|
|
|
|
UVPtStruct & uvPt = (*points)[i];
|
|
|
|
uvPt.node = 0;
|
|
|
|
uvPt.x = uvPt.y = uvPt.param = uvPt.normParam = normPar;
|
|
|
|
if ( isXConst ) uvPt.x = constValue;
|
|
|
|
else uvPt.y = constValue;
|
|
|
|
if ( myNormPar[ EdgeIndex ] < normPar ) {
|
|
|
|
prevNormPar = myNormPar[ EdgeIndex ];
|
|
|
|
++EdgeIndex;
|
|
|
|
paramSize = myNormPar[ EdgeIndex ] - prevNormPar;
|
|
|
|
}
|
|
|
|
double r = ( normPar - prevNormPar )/ paramSize;
|
|
|
|
uvPt.param = myFirst[EdgeIndex] * ( 1 - r ) + myLast[EdgeIndex] * r;
|
|
|
|
if ( !myC2d[ EdgeIndex ].IsNull() ) {
|
|
|
|
gp_Pnt2d p = myC2d[ EdgeIndex ]->Value( uvPt.param );
|
|
|
|
uvPt.u = p.X();
|
|
|
|
uvPt.v = p.Y();
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
uvPt.u = uvPt.v = 1e+100;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return myFalsePoints;
|
|
|
|
}
|
|
|
|
// gp_Pnt StdMeshers_FaceSide::Value(double U) const
|
|
|
|
// {
|
|
|
|
// }
|
|
|
|
|
|
|
|
//================================================================================
|
|
|
|
/*!
|
|
|
|
* \brief reverse order of vector elements
|
|
|
|
* \param vec - vector to reverse
|
|
|
|
*/
|
|
|
|
//================================================================================
|
|
|
|
|
|
|
|
template <typename T > void reverse(vector<T> & vec)
|
|
|
|
{
|
|
|
|
for ( int f=0, r=vec.size()-1; f < r; ++f, --r )
|
|
|
|
std::swap( vec[f], vec[r] );
|
|
|
|
}
|
|
|
|
|
|
|
|
//================================================================================
|
|
|
|
/*!
|
|
|
|
* \brief Change orientation of side geometry
|
|
|
|
*/
|
|
|
|
//================================================================================
|
|
|
|
|
|
|
|
void StdMeshers_FaceSide::Reverse()
|
|
|
|
{
|
|
|
|
int nbEdges = myEdge.size();
|
|
|
|
for ( int i = nbEdges-1; i >= 0; --i ) {
|
|
|
|
std::swap( myFirst[i], myLast[i] );
|
|
|
|
myEdge[i].Reverse();
|
|
|
|
if ( i > 0 ) // at the first loop 1. is overwritten
|
|
|
|
myNormPar[i] = 1 - myNormPar[i-1];
|
|
|
|
}
|
|
|
|
if ( nbEdges > 1 ) {
|
|
|
|
reverse( myEdge );
|
|
|
|
reverse( myC2d );
|
|
|
|
reverse( myFirst );
|
|
|
|
reverse( myLast );
|
|
|
|
reverse( myNormPar );
|
|
|
|
}
|
|
|
|
myNormPar[nbEdges-1]=1.;
|
|
|
|
myPoints.clear();
|
|
|
|
myFalsePoints.clear();
|
|
|
|
}
|
|
|
|
|
|
|
|
//================================================================================
|
|
|
|
/*!
|
|
|
|
* \brief Show side features
|
|
|
|
*/
|
|
|
|
//================================================================================
|
|
|
|
|
|
|
|
void StdMeshers_FaceSide::dump(const char* msg) const
|
|
|
|
{
|
|
|
|
#ifdef _DEBUG_
|
2009-02-17 10:27:49 +05:00
|
|
|
if (msg) MESSAGE ( std::endl << msg );
|
|
|
|
MESSAGE_BEGIN ("NB EDGES: "<< myEdge.size() );
|
|
|
|
MESSAGE_ADD ( "nbPoints: "<<myNbPonits<<" vecSize: " << myPoints.size()<<" "<<myFalsePoints.size() );
|
2008-03-07 12:47:05 +05:00
|
|
|
for ( int i=0; i<myEdge.size(); ++i)
|
|
|
|
{
|
2009-02-17 10:27:49 +05:00
|
|
|
MESSAGE_ADD ( "\t"<<i+1 );
|
|
|
|
MESSAGE_ADD ( "\tEDGE: " );
|
|
|
|
if (myEdge[i].IsNull()) {
|
|
|
|
MESSAGE_ADD ( "NULL" );
|
|
|
|
}
|
2008-03-07 12:47:05 +05:00
|
|
|
else {
|
|
|
|
TopAbs::Print(myEdge[i].Orientation(),cout)<<" "<<myEdge[i].TShape().operator->()<<endl;
|
2009-02-17 10:27:49 +05:00
|
|
|
MESSAGE_ADD ( "\tV1: " << TopExp::FirstVertex( myEdge[i], 1).TShape().operator->()
|
|
|
|
<< " V2: " << TopExp::LastVertex( myEdge[i], 1).TShape().operator->() );
|
2008-03-07 12:47:05 +05:00
|
|
|
}
|
2009-02-17 10:27:49 +05:00
|
|
|
MESSAGE_ADD ( "\tC2d: ");
|
|
|
|
|
|
|
|
if (myC2d[i].IsNull()) {
|
|
|
|
MESSAGE_ADD ( "NULL" );
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
MESSAGE_ADD ( myC2d[i].operator->() );
|
|
|
|
}
|
|
|
|
|
|
|
|
MESSAGE_ADD ( "\tF: "<<myFirst[i]<< " L: "<< myLast[i] );
|
|
|
|
MESSAGE_END ( "\tnormPar: "<<myNormPar[i]<<endl );
|
2008-03-07 12:47:05 +05:00
|
|
|
}
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
//================================================================================
|
|
|
|
/*!
|
|
|
|
* \brief Creates a Adaptor2d_Curve2d to be used in SMESH_Block
|
|
|
|
* \retval Adaptor2d_Curve2d* -
|
|
|
|
*/
|
|
|
|
//================================================================================
|
|
|
|
|
|
|
|
struct Adaptor2dCurve2d : public Adaptor2d_Curve2d
|
|
|
|
{
|
|
|
|
const StdMeshers_FaceSide* mySide;
|
|
|
|
Adaptor2dCurve2d(const StdMeshers_FaceSide* faceSide):mySide(faceSide) {}
|
|
|
|
gp_Pnt2d Value(const Standard_Real U) const { return mySide->Value2d( U ); }
|
|
|
|
Standard_Real FirstParameter() const { return 0; }
|
|
|
|
Standard_Real LastParameter() const { return 1; }
|
|
|
|
};
|
|
|
|
|
|
|
|
Adaptor2d_Curve2d* StdMeshers_FaceSide::GetCurve2d() const
|
|
|
|
{
|
|
|
|
return new Adaptor2dCurve2d( this );
|
|
|
|
}
|
|
|
|
|
|
|
|
//================================================================================
|
|
|
|
/*!
|
|
|
|
* \brief Creates a fully functional Adaptor_Curve
|
|
|
|
*/
|
|
|
|
//================================================================================
|
|
|
|
|
|
|
|
BRepAdaptor_CompCurve* StdMeshers_FaceSide::GetCurve3d() const
|
|
|
|
{
|
|
|
|
if ( myEdge.empty() )
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
// if ( myEdge.size() == 1 )
|
|
|
|
// return new BRepAdaptor_Curve( myEdge[0] );
|
|
|
|
|
|
|
|
TopoDS_Wire aWire;
|
|
|
|
BRep_Builder aBuilder;
|
|
|
|
aBuilder.MakeWire(aWire);
|
|
|
|
for ( int i=0; i<myEdge.size(); ++i )
|
|
|
|
aBuilder.Add( aWire, myEdge[i] );
|
|
|
|
return new BRepAdaptor_CompCurve( aWire );
|
|
|
|
}
|
|
|
|
|
|
|
|
//================================================================================
|
|
|
|
/*!
|
|
|
|
* \brief Return 2D point by normalized parameter
|
|
|
|
* \param U - normalized parameter value
|
|
|
|
* \retval gp_Pnt2d - point
|
|
|
|
*/
|
|
|
|
//================================================================================
|
|
|
|
|
|
|
|
gp_Pnt2d StdMeshers_FaceSide::Value2d(double U) const
|
|
|
|
{
|
|
|
|
if ( !myC2d[0].IsNull() ) {
|
|
|
|
int i = EdgeIndex( U );
|
|
|
|
double prevU = i ? myNormPar[ i-1 ] : 0;
|
|
|
|
double r = ( U - prevU )/ ( myNormPar[ i ] - prevU );
|
|
|
|
return myC2d[ i ]->Value( myFirst[i] * ( 1 - r ) + myLast[i] * r );
|
|
|
|
}
|
|
|
|
return gp_Pnt2d( 1e+100, 1e+100 );
|
|
|
|
}
|
|
|
|
|
|
|
|
//================================================================================
|
|
|
|
/*!
|
|
|
|
* \brief Return wires of a face as StdMeshers_FaceSide's
|
|
|
|
*/
|
|
|
|
//================================================================================
|
|
|
|
|
|
|
|
TSideVector StdMeshers_FaceSide::GetFaceWires(const TopoDS_Face& theFace,
|
|
|
|
SMESH_Mesh & theMesh,
|
|
|
|
const bool theIgnoreMediumNodes,
|
|
|
|
TError & theError)
|
|
|
|
{
|
|
|
|
TopoDS_Vertex V1;
|
|
|
|
list< TopoDS_Edge > edges;
|
|
|
|
list< int > nbEdgesInWires;
|
|
|
|
int nbWires = SMESH_Block::GetOrderedEdges (theFace, V1, edges, nbEdgesInWires);
|
|
|
|
|
|
|
|
// split list of all edges into separate wires
|
|
|
|
TSideVector wires( nbWires );
|
|
|
|
list< int >::iterator nbE = nbEdgesInWires.begin();
|
|
|
|
list< TopoDS_Edge >::iterator from, to;
|
|
|
|
from = to = edges.begin();
|
|
|
|
for ( int iW = 0; iW < nbWires; ++iW )
|
|
|
|
{
|
|
|
|
std::advance( to, *nbE++ );
|
|
|
|
list< TopoDS_Edge > wireEdges( from, to );
|
|
|
|
// assure that there is a node on the first vertex
|
|
|
|
// as StdMeshers_FaceSide::GetUVPtStruct() requires
|
|
|
|
while ( !SMESH_Algo::VertexNode( TopExp::FirstVertex( wireEdges.front(), true),
|
|
|
|
theMesh.GetMeshDS()))
|
|
|
|
{
|
|
|
|
wireEdges.splice(wireEdges.end(), wireEdges,
|
|
|
|
wireEdges.begin(), ++wireEdges.begin());
|
|
|
|
if ( from->IsSame( wireEdges.front() )) {
|
|
|
|
theError = TError
|
|
|
|
( new SMESH_ComputeError(COMPERR_BAD_INPUT_MESH,"No nodes on vertices"));
|
|
|
|
return TSideVector(0);
|
|
|
|
}
|
|
|
|
}
|
2009-02-17 10:27:49 +05:00
|
|
|
// find out side orientation, which is important if there are several wires (PAL19080)
|
|
|
|
bool isForward = true;
|
|
|
|
if ( nbWires > 1 ) {
|
|
|
|
TopExp_Explorer e( theFace, TopAbs_EDGE );
|
|
|
|
while ( ! e.Current().IsSame( wireEdges.back() ))
|
|
|
|
e.Next();
|
|
|
|
isForward = ( e.Current().Orientation() == wireEdges.back().Orientation() );
|
|
|
|
}
|
|
|
|
|
2008-03-07 12:47:05 +05:00
|
|
|
StdMeshers_FaceSide* wire = new StdMeshers_FaceSide( theFace, wireEdges, &theMesh,
|
2009-02-17 10:27:49 +05:00
|
|
|
isForward, theIgnoreMediumNodes);
|
2008-03-07 12:47:05 +05:00
|
|
|
wires[ iW ] = StdMeshers_FaceSidePtr( wire );
|
|
|
|
from = to;
|
|
|
|
}
|
|
|
|
return wires;
|
|
|
|
}
|
|
|
|
|