mirror of
https://git.dev.opencascade.org/repos/occt.git
synced 2025-05-21 10:55:33 +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.
138 lines
5.0 KiB
C++
138 lines
5.0 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.
|
|
|
|
#ifndef MeshTest_CheckTopology_HeaderFile
|
|
#define MeshTest_CheckTopology_HeaderFile
|
|
|
|
#include <TopoDS_Shape.hxx>
|
|
#include <NCollection_IndexedDataMap.hxx>
|
|
#include <TColStd_HSequenceOfInteger.hxx>
|
|
#include <TColStd_SequenceOfReal.hxx>
|
|
#include <Draw_Interpretor.hxx>
|
|
|
|
//! This class checks topology of the mesh presented by
|
|
//! triangulations of faces.
|
|
//!
|
|
//! The following error are reported:
|
|
//! - free links. A link is considered free if it has only one
|
|
//! neighboring triangle and at least one of its nodes belongs to
|
|
//! interior of the face rather than to its boundary.
|
|
//! - cross face errors. It is a situation when a point on a common
|
|
//! boundary between two faces has different 3d coordinates on each
|
|
//! triangulation. The error is reported if the distance is greater
|
|
//! than a deflection written in triangulations.
|
|
//! - asynchronous edges. It is an edge having polygons on two neighboring
|
|
//! triangulations with different number of points in the polygons.
|
|
//! - free nodes -- nodes not shared by any triangle.
|
|
|
|
class MeshTest_CheckTopology
|
|
{
|
|
public:
|
|
//! constructor
|
|
MeshTest_CheckTopology(const TopoDS_Shape& theShape)
|
|
: myShape(theShape) {}
|
|
|
|
//! performs checking
|
|
Standard_EXPORT void Perform(Draw_Interpretor& di);
|
|
|
|
//! returns the number of faces with free links
|
|
Standard_Integer NbFacesWithFL() const
|
|
{ return myMapFaceLinks.Extent(); }
|
|
|
|
//! returns the number (in the shape) of a face with free links
|
|
//! with the given index
|
|
Standard_Integer GetFaceNumWithFL(const Standard_Integer theIndex) const
|
|
{ return myMapFaceLinks.FindKey(theIndex); }
|
|
|
|
//! returns the number free links on a face with the given index
|
|
Standard_Integer NbFreeLinks(const Standard_Integer theIndex) const
|
|
{ return myMapFaceLinks(theIndex)->Length() / 2; }
|
|
|
|
//! gets the numbers of nodes of a free link with the given index
|
|
//! in the face with the given index
|
|
Standard_EXPORT void GetFreeLink(const Standard_Integer theFaceIndex,
|
|
const Standard_Integer theLinkIndex,
|
|
Standard_Integer& theNode1,
|
|
Standard_Integer& theNode2) const;
|
|
|
|
//! returns the number of cross face errors
|
|
Standard_Integer NbCrossFaceErrors() const
|
|
{ return myErrorsVal.Length(); }
|
|
|
|
//! gets the attributes of a cross face error with the given index
|
|
Standard_EXPORT void GetCrossFaceError(const Standard_Integer theIndex,
|
|
Standard_Integer& theFace1,
|
|
Standard_Integer& theNode1,
|
|
Standard_Integer& theFace2,
|
|
Standard_Integer& theNode2,
|
|
Standard_Real& theValue) const;
|
|
|
|
//! returns the number of async edges
|
|
Standard_Integer NbAsyncEdges() const
|
|
{ return myAsyncEdges.Length(); }
|
|
|
|
//! returns the number (in the shape) of an async edge with the given index
|
|
Standard_Integer GetAsyncEdgeNum(const Standard_Integer theIndex) const
|
|
{ return myAsyncEdges(theIndex); }
|
|
|
|
//! returns the number of free nodes
|
|
Standard_Integer NbFreeNodes() const
|
|
{ return myFreeNodeFaces.Length(); }
|
|
|
|
//! returns the number of face containing the Index-th detected free node,
|
|
//! and number of this node in the triangulation of that face
|
|
void GetFreeNodeNum (const Standard_Integer theIndex,
|
|
Standard_Integer& theFaceNum,
|
|
Standard_Integer& theNodeNum) const
|
|
{
|
|
theFaceNum = myFreeNodeFaces(theIndex);
|
|
theNodeNum = myFreeNodeNums(theIndex);
|
|
}
|
|
|
|
//! Returns number of triangles with null area
|
|
Standard_Integer NbSmallTriangles() const
|
|
{
|
|
return mySmallTrianglesFaces.Length();
|
|
}
|
|
|
|
//! returns the number of face containing the Index-th detected
|
|
//! small triangle and number of the problematic triangle in
|
|
//! this face.
|
|
void GetSmallTriangle(const Standard_Integer theIndex,
|
|
Standard_Integer& theFaceNum,
|
|
Standard_Integer& theNodeNum) const
|
|
{
|
|
theFaceNum = mySmallTrianglesFaces(theIndex);
|
|
theNodeNum = mySmallTrianglesTriangles(theIndex);
|
|
}
|
|
|
|
private:
|
|
TopoDS_Shape myShape;
|
|
NCollection_IndexedDataMap<Standard_Integer,Handle(TColStd_HSequenceOfInteger)>
|
|
myMapFaceLinks;
|
|
|
|
TColStd_SequenceOfInteger myErrors;
|
|
TColStd_SequenceOfReal myErrorsVal;
|
|
|
|
TColStd_SequenceOfInteger myAsyncEdges;
|
|
TColStd_SequenceOfInteger myFreeNodeFaces;
|
|
TColStd_SequenceOfInteger myFreeNodeNums;
|
|
TColStd_SequenceOfInteger mySmallTrianglesFaces;
|
|
TColStd_SequenceOfInteger mySmallTrianglesTriangles;
|
|
|
|
};
|
|
|
|
#endif
|