mirror of
https://git.dev.opencascade.org/repos/occt.git
synced 2025-04-03 17:56:21 +03:00
8109385697
1) BRepMesh_FastDiscretFace.cxx: - exclude planes from procedure of inserting internal points. - localize declaration of the container aNewVertices in each method where it is needed. - correct the logic of the method insertInternalVerticesOther, so that to separate the processes of removing extra points and addition of new points in different cycles, thus making the code more clear and in addition stable. - insert useful output of intermediate mesh to a file in control() method for debug purposes (with definition DEBUG_MESH). 2) Add global functions MeshTest_DrawTriangles and MeshTest_DrawLinks to draw mesh data in debug session. 3) BRepMesh_FastDiscret: - in the method Add calculations of deflections have been simplified for non-relative mode. - replace the attribute MinDist with Deflection in EdgeAttributes structure. Correct its computation so that later to store this value as deflection of the polygon. 4) Make protection against exception in the method BRepMesh_Delaun::addTriangle() when an added triangle creates a third connection of a mesh edge. 5) BRepMesh_EdgeTessellator.cxx, BRepMesh_EdgeTessellationExtractor.cxx: use Geom2dAdaptor_Curve in order to use b-spline cache while computing value on a curve. 6) In BndLib_Box2dCurve::PerformBSpline, avoid creating new b-spline in case of requested parameter range differ from natural bounds insignificantly. 7) In GeomAdaptor classes, postpone building of cache till the time of its actual usage. So, creation of an adapter to compute intervals of continuity does not lead to creation of internal cache. 8) In the methods BRepAdaptor_Curve::Bezier and BSpline do not call Transformed() if transformation is identity. 9) In the classes Geom_BSplineCurve, Geom_BSplineSurface, Geom_BezierCurve, Geom_BezierSurface, Geom2d_BSplineCurve, Geom2d_BezierCurve change the method Pole() to return the point by const reference. 10) In CPnts_AbscissaPoint.cxx, compute derivative by D1 instead of DN to make use of b-spline cache. 11) Change test cases to actual state: - Number of triangles/nodes can grow due to more accurate work with deflection of edges. Now the edge is tessellated using its own tolerance instead of maximal tolerance of all shapes in the face. - Accept new numbers of mesh errors (free links, free nodes) for really bad shapes. - Correct the test "bugs/mesh/bug25612" to produce stable result. - Disable redundant checks in test cases bug25378* (lower limit for computation time). - Speed up iso-lines computation for offset of bspline surfaces. For that use adaptor instead of original surface in evaluator of approximation. - Add output of polylines for debug of insertInternalVerticesOther(). Reference data in test case bugs\moddata_2\bug453_3 have been changed to be close to expected theoretical values. This makes the test give stable result on different platforms.
33 lines
1.0 KiB
Plaintext
Executable File
33 lines
1.0 KiB
Plaintext
Executable File
puts "============"
|
|
puts "CR25378"
|
|
puts "============"
|
|
puts ""
|
|
###################################################################################
|
|
# Building of triangulation for distored surfaces can take very long using BRepMesh_IncrementalMesh
|
|
#
|
|
# Test case was created to control bad situation, building of triangulation takes
|
|
# very long time and it is expected by the meaning of issue #25378.
|
|
# Case when it is passed too fast should be considered as failure.
|
|
###################################################################################
|
|
|
|
cpulimit 900
|
|
|
|
restore [locate_data_file bug25378_Blower_bad.brep] b
|
|
trinfo b
|
|
|
|
tclean b
|
|
set t_01 [expr [lindex [time {incmesh b 0.01}] 0]/1000000]
|
|
puts "t_01=${t_01}"
|
|
trinfo b
|
|
|
|
if { [regexp {Debug mode} [dversion]] } {
|
|
set max_t_01 180
|
|
} else {
|
|
set max_t_01 1
|
|
}
|
|
|
|
# this test case is redundant, as we must not set lower limit for computation time
|
|
#if {${max_t_01} > ${t_01}} {
|
|
# puts "Error. Time of building of triangulation, ${t_01} seconds, is less than expected minimum time - ${max_t_01} seconds"
|
|
#}
|