mirror of
https://git.dev.opencascade.org/repos/occt.git
synced 2025-04-21 10:13:43 +03:00
7bd071edb1
Removed tight connections between data structures, auxiliary tools and algorithms in order to create extensible solution, easy for maintenance and improvements; Code is separated on several functional units responsible for specific operation for the sake of simplification of debugging and readability; Introduced new data structures enabling possibility to manipulate discrete model of particular entity (edge, wire, face) in order to perform computations locally instead of processing an entire model. The workflow of updated component can be divided on six parts: * Creation of model data structure: source TopoDS_Shape passed to algorithm is analyzed and exploded on faces and edges. For each topological entity corresponding reflection is created in data model. Note that underlying algorithms use data model as input and access it via common interface which allows user to create custom data model with necessary dependencies between particular entities; * Discretize edges 3D & 2D curves: 3D curve as well as associated set of 2D curves of each model edge is discretized in order to create coherent skeleton used as a base in faces meshing process. In case if some edge of source shape already contains polygonal data which suites specified parameters, it is extracted from shape and stored to the model as is. Each edge is processed separately, adjacency is not taken into account; * Heal discrete model: source TopoDS_Shape can contain problems, such as open-wire or self-intersections, introduced during design, exchange or modification of model. In addition, some problems like self-intersections can be introduced by roughly discretized edges. This stage is responsible for analysis of discrete model in order to detect and repair faced problems or refuse model’s part for further processing in case if problem cannot be solved; * Preprocess discrete model: defines actions specific for implemented approach to be performed before meshing of faces. By default, iterates over model faces and checks consistency of existing triangulations. Cleans topological faces and its adjacent edges from polygonal data in case of inconsistency or marks face of discrete model as not required for computation; * Discretize faces: represents core part performing mesh generation for particular face based on 2D discrete data related to processing face. Caches polygonal data associated with face’s edges in data model for further processing and stores generated mesh to TopoDS_Face; * Postprocess discrete model: defines actions specific for implemented approach to be performed after meshing of faces. By default, stores polygonal data obtained on previous stage to TopoDS_Edge objects of source model. Component is now spread over IMeshData, IMeshTools, BRepMeshData and BRepMesh units. <!break> 1. Extend "tricheck" DRAW-command in order to find degenerated triangles. 2. Class BRepMesh_FastDiscret::Parameters has been declared as deprecated. 3. NURBS range splitter: do not split intervals without necessity. Intervals are split only in case if it is impossible to compute normals directly on intervals. 4. Default value of IMeshTools_Parameters::MinSize has been changed. New value is equal to 0.1*Deflection. 5. Correction of test scripts: 1) perf mesh bug27119: requested deflection is increased from 1e-6 to 1e-5 to keep reasonable performance (but still reproducing original issue) 2) bugs mesh bug26692_1, 2: make snapshot of triangulation instead of wireframe (irrelevant) Correction in upgrade guide.
270 lines
9.7 KiB
C++
270 lines
9.7 KiB
C++
// Created on: 2004-05-10
|
|
// Created by: Michael SAZONOV
|
|
// Copyright (c) 2004-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 <MeshTest_CheckTopology.hxx>
|
|
#include <BRep_Tool.hxx>
|
|
#include <TColStd_PackedMapOfInteger.hxx>
|
|
#include <TopExp.hxx>
|
|
#include <TopExp_Explorer.hxx>
|
|
#include <TopoDS_Edge.hxx>
|
|
#include <TopoDS.hxx>
|
|
#include <TopoDS_Face.hxx>
|
|
#include <TopLoc_Location.hxx>
|
|
#include <TopTools_IndexedMapOfShape.hxx>
|
|
#include <TopTools_IndexedDataMapOfShapeListOfShape.hxx>
|
|
#include <TopTools_ListOfShape.hxx>
|
|
#include <TopTools_ListIteratorOfListOfShape.hxx>
|
|
#include <Poly_Triangulation.hxx>
|
|
#include <Poly_PolygonOnTriangulation.hxx>
|
|
#include <Poly_Connect.hxx>
|
|
#include <Precision.hxx>
|
|
|
|
//=======================================================================
|
|
//function : ComputeArea
|
|
//purpose : Computes area of the triangle given by its three points (either 2D or3D)
|
|
//=======================================================================
|
|
static Standard_Real ComputeArea(const gp_XYZ& theP1,
|
|
const gp_XYZ& theP2,
|
|
const gp_XYZ& theP3)
|
|
{
|
|
return 0.5*(theP3 - theP1).Crossed(theP2 - theP1).Modulus();
|
|
}
|
|
|
|
//=======================================================================
|
|
//function : ComputeArea
|
|
//purpose : Computes area of the triangle given by its three points (either 2D or3D)
|
|
//=======================================================================
|
|
static Standard_Real ComputeArea(const gp_XY& theP1,
|
|
const gp_XY& theP2,
|
|
const gp_XY& theP3)
|
|
{
|
|
return 0.5*Abs((theP3 - theP1).Crossed(theP2 - theP1));
|
|
}
|
|
|
|
//=======================================================================
|
|
//function : Perform
|
|
//purpose : Performs checking
|
|
//=======================================================================
|
|
|
|
void MeshTest_CheckTopology::Perform (Draw_Interpretor& di)
|
|
{
|
|
TopTools_IndexedMapOfShape aMapF;
|
|
TopTools_IndexedDataMapOfShapeListOfShape aMapEF;
|
|
TopExp::MapShapes (myShape, TopAbs_FACE, aMapF);
|
|
TopExp::MapShapesAndAncestors (myShape, TopAbs_EDGE, TopAbs_FACE, aMapEF);
|
|
|
|
// check polygons
|
|
Standard_Integer ie;
|
|
for (ie=1; ie <= aMapEF.Extent(); ie++) {
|
|
const TopoDS_Edge& aEdge = TopoDS::Edge(aMapEF.FindKey(ie));
|
|
const TopTools_ListOfShape& aFaces = aMapEF(ie);
|
|
if (aFaces.Extent() < 2) continue;
|
|
|
|
// get polygon on first face
|
|
const TopoDS_Face& aFace1 = TopoDS::Face(aFaces.First());
|
|
TopLoc_Location aLoc1;
|
|
Handle(Poly_Triangulation) aT1 = BRep_Tool::Triangulation(aFace1, aLoc1);
|
|
Handle(Poly_PolygonOnTriangulation) aPoly1 =
|
|
BRep_Tool::PolygonOnTriangulation(aEdge, aT1, aLoc1);
|
|
if (aPoly1.IsNull() || aT1.IsNull()) {
|
|
#ifdef OCCT_DEBUG
|
|
cout<<"problem getting PolygonOnTriangulation of edge "<<ie<<endl;
|
|
#endif
|
|
continue;
|
|
}
|
|
const TColStd_Array1OfInteger& aNodes1 = aPoly1->Nodes();
|
|
|
|
// cycle on other polygons
|
|
TopTools_ListIteratorOfListOfShape it(aFaces);
|
|
it.Next();
|
|
for (; it.More(); it.Next()) {
|
|
const TopoDS_Face& aFace2 = TopoDS::Face(it.Value());
|
|
TopLoc_Location aLoc2;
|
|
Handle(Poly_Triangulation) aT2 = BRep_Tool::Triangulation(aFace2, aLoc2);
|
|
Handle(Poly_PolygonOnTriangulation) aPoly2 =
|
|
BRep_Tool::PolygonOnTriangulation(aEdge, aT2, aLoc2);
|
|
if (aPoly2.IsNull() || aT2.IsNull()) {
|
|
#ifdef OCCT_DEBUG
|
|
cout<<"problem getting PolygonOnTriangulation of edge "<<ie<<endl;
|
|
#endif
|
|
continue;
|
|
}
|
|
const TColStd_Array1OfInteger& aNodes2 = aPoly2->Nodes();
|
|
|
|
// check equality of polygons lengths
|
|
if (aNodes2.Length() != aNodes1.Length()) {
|
|
myAsyncEdges.Append(ie);
|
|
break;
|
|
}
|
|
|
|
// check distances between corresponding points
|
|
Standard_Real aSqDefle = Max(aT1->Deflection(), aT2->Deflection());
|
|
aSqDefle *= aSqDefle;
|
|
const TColgp_Array1OfPnt& aPoints1 = aT1->Nodes();
|
|
const TColgp_Array1OfPnt& aPoints2 = aT2->Nodes();
|
|
Standard_Integer iF1 = aMapF.FindIndex(aFace1);
|
|
Standard_Integer iF2 = aMapF.FindIndex(aFace2);
|
|
Standard_Integer i1 = aNodes1.Lower();
|
|
Standard_Integer i2 = aNodes2.Lower();
|
|
const gp_Trsf &aTrsf1 = aFace1.Location().Transformation();
|
|
const gp_Trsf &aTrsf2 = aFace2.Location().Transformation();
|
|
for (; i1 <= aNodes1.Upper(); i1++, i2++) {
|
|
const gp_Pnt aP1 = aPoints1(aNodes1(i1)).Transformed(aTrsf1);
|
|
const gp_Pnt aP2 = aPoints2(aNodes2(i2)).Transformed(aTrsf2);
|
|
const Standard_Real aSqDist = aP1.SquareDistance(aP2);
|
|
if (aSqDist > aSqDefle)
|
|
{
|
|
myErrors.Append(iF1);
|
|
myErrors.Append(i1);
|
|
myErrors.Append(iF2);
|
|
myErrors.Append(i2);
|
|
myErrorsVal.Append(Sqrt(aSqDist));
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
// check triangulations
|
|
Standard_Integer iF;
|
|
for (iF=1; iF <= aMapF.Extent(); iF++) {
|
|
const TopoDS_Face& aFace = TopoDS::Face(aMapF.FindKey(iF));
|
|
TopLoc_Location aLoc;
|
|
Handle(Poly_Triangulation) aT = BRep_Tool::Triangulation(aFace, aLoc);
|
|
if (aT.IsNull()) {
|
|
di << "face " <<iF <<" has no triangulation\n";
|
|
continue;
|
|
}
|
|
|
|
const gp_Trsf &aTrsf = aLoc.Transformation();
|
|
|
|
// remember boundary nodes
|
|
TColStd_PackedMapOfInteger aMapBndNodes;
|
|
TopExp_Explorer ex(aFace, TopAbs_EDGE);
|
|
for (; ex.More(); ex.Next()) {
|
|
const TopoDS_Edge& aEdge = TopoDS::Edge(ex.Current());
|
|
Handle(Poly_PolygonOnTriangulation) aPoly =
|
|
BRep_Tool::PolygonOnTriangulation(aEdge, aT, aLoc);
|
|
if (aPoly.IsNull()) continue;
|
|
const TColStd_Array1OfInteger& aNodes = aPoly->Nodes();
|
|
Standard_Integer i;
|
|
for (i=aNodes.Lower(); i <= aNodes.Upper(); i++)
|
|
aMapBndNodes.Add(aNodes(i));
|
|
}
|
|
|
|
TColStd_PackedMapOfInteger aUsedNodes;
|
|
|
|
// check of free links and nodes
|
|
Poly_Connect aConn(aT);
|
|
const Poly_Array1OfTriangle& aTriangles = aT->Triangles();
|
|
Standard_Integer nbTri = aT->NbTriangles(), i, j, n[3], t[3];
|
|
for (i = 1; i <= nbTri; i++) {
|
|
aTriangles(i).Get(n[0], n[1], n[2]);
|
|
|
|
aUsedNodes.Add (n[0]);
|
|
aUsedNodes.Add (n[1]);
|
|
aUsedNodes.Add (n[2]);
|
|
|
|
const gp_Pnt aPts[3] = {aT->Node(n[0]).Transformed(aTrsf),
|
|
aT->Node(n[1]).Transformed(aTrsf),
|
|
aT->Node(n[2]).Transformed(aTrsf)};
|
|
|
|
Standard_Real anArea = ComputeArea(aPts[0].XYZ(), aPts[1].XYZ(), aPts[2].XYZ());
|
|
if (anArea < Precision::SquareConfusion())
|
|
{
|
|
mySmallTrianglesFaces.Append(iF);
|
|
mySmallTrianglesTriangles.Append(i);
|
|
}
|
|
else if (aT->HasUVNodes())
|
|
{
|
|
const gp_XY aPUV[3] = {aT->UVNode(n[0]).XY(),
|
|
aT->UVNode(n[1]).XY(),
|
|
aT->UVNode(n[2]).XY()};
|
|
anArea = ComputeArea(aPUV[0], aPUV[1], aPUV[2]);
|
|
if (anArea < Precision::SquarePConfusion())
|
|
{
|
|
mySmallTrianglesFaces.Append(iF);
|
|
mySmallTrianglesTriangles.Append(i);
|
|
}
|
|
}
|
|
|
|
aConn.Triangles(i, t[0], t[1], t[2]);
|
|
for (j = 0; j < 3; j++) {
|
|
if (t[j] == 0) {
|
|
// free link found
|
|
Standard_Integer k = (j+1) % 3; // the following node of the edge
|
|
Standard_Integer n1 = n[j];
|
|
Standard_Integer n2 = n[k];
|
|
// skip if it is on boundary
|
|
if (aMapBndNodes.Contains(n1) && aMapBndNodes.Contains(n2))
|
|
continue;
|
|
if (!myMapFaceLinks.Contains(iF)) {
|
|
Handle(TColStd_HSequenceOfInteger) tmpSeq = new TColStd_HSequenceOfInteger;
|
|
myMapFaceLinks.Add(iF, tmpSeq);
|
|
}
|
|
Handle(TColStd_HSequenceOfInteger)& aSeq = myMapFaceLinks.ChangeFromKey(iF);
|
|
aSeq->Append(n1);
|
|
aSeq->Append(n2);
|
|
}
|
|
}
|
|
}
|
|
|
|
// check of free nodes
|
|
Standard_Integer aNbNodes = aT->NbNodes();
|
|
for (Standard_Integer k = 1; k <= aNbNodes; k++)
|
|
if ( ! aUsedNodes.Contains(k) )
|
|
{
|
|
myFreeNodeFaces.Append (iF);
|
|
myFreeNodeNums.Append (k);
|
|
}
|
|
}
|
|
}
|
|
|
|
//=======================================================================
|
|
//function : GetFreeLink
|
|
//purpose : gets the numbers of nodes of a free link with the given index
|
|
// in the face with the given index
|
|
//=======================================================================
|
|
|
|
void MeshTest_CheckTopology::GetFreeLink(const Standard_Integer theFaceIndex,
|
|
const Standard_Integer theLinkIndex,
|
|
Standard_Integer& theNode1,
|
|
Standard_Integer& theNode2) const
|
|
{
|
|
const Handle(TColStd_HSequenceOfInteger)& aSeq = myMapFaceLinks(theFaceIndex);
|
|
Standard_Integer aInd = (theLinkIndex-1)*2 + 1;
|
|
theNode1 = aSeq->Value(aInd);
|
|
theNode2 = aSeq->Value(aInd+1);
|
|
}
|
|
|
|
//=======================================================================
|
|
//function : GetCrossFaceError
|
|
//purpose : gets the attributes of a cross face error with the given index
|
|
//=======================================================================
|
|
|
|
void MeshTest_CheckTopology::GetCrossFaceError(const Standard_Integer theIndex,
|
|
Standard_Integer& theFace1,
|
|
Standard_Integer& theNode1,
|
|
Standard_Integer& theFace2,
|
|
Standard_Integer& theNode2,
|
|
Standard_Real& theValue) const
|
|
{
|
|
Standard_Integer aInd = (theIndex-1)*4 + 1;
|
|
theFace1 = myErrors(aInd);
|
|
theNode1 = myErrors(aInd+1);
|
|
theFace2 = myErrors(aInd+2);
|
|
theNode2 = myErrors(aInd+3);
|
|
theValue = myErrorsVal(theIndex);
|
|
}
|