mirror of
https://git.dev.opencascade.org/repos/occt.git
synced 2025-04-03 17:56:21 +03:00
4bc805bfc6
In the algorithm math_FunctionRoots, improve the case when it is needed to find the extremum of the function. Earlier, to solve this task the method of gold section was used. With the patch, firstly the algorithm tries to find zero value of the derivative function. In most cases it gives precise result. Secondly, the algorithm tries to find zero value of the function using the old approach. The algorithm chooses the best solution among two computed by different methods. In the method PutStickPavesOnCurve of BOPAlgo_PaveFiller, forbid putting a vertex to the end of the curve if this end already has a vertex assigned to it. This allows getting rid of unwanted colliding of vertices. In the method UpdatePaveBlocks of BOPAlgo_PaveFiller, make the check for micro edges more precise. New category of tests "lowalgos" has been added. Tests for low level algorithms are to be put there. "2dinter" is a new group of tests in this category. Introduction of the new key for "2dintersect" command, allowing printing the intersection state for each point. It has the following syntax now: "2dintersect curve1 [curve2] [-tol tol] [-state]" Options: -tol - allows changing the intersection tolerance (default value is 1.e-3); -state - allows printing the intersection state for each point. Correct the test case bugs/modalg_7/bug28274 to make proper checks of the result.
37 lines
1.0 KiB
Plaintext
Executable File
37 lines
1.0 KiB
Plaintext
Executable File
puts "============"
|
|
puts "CR23587"
|
|
puts "==========="
|
|
puts ""
|
|
###############################################################################
|
|
# Operation "2dintersect "in TestHarness can not find intersection point of two intersecting 2d curves.
|
|
###############################################################################
|
|
|
|
restore [locate_data_file bug23587_IntEdges.brep] a
|
|
|
|
explode a
|
|
|
|
plane pl1 0 0 0 0 0 1
|
|
trim trpl1 pl1 -1000 1000 -1000 1000
|
|
mkface f1 trpl1
|
|
pcurve c1 a_1 f1
|
|
pcurve c2 a_2 f1
|
|
pcurve c3 a_3 f1
|
|
pcurve c4 a_4 f1
|
|
set inter1 [2dintersect c1 c2 -tol 1.e-6]
|
|
set inter2 [2dintersect c3 c2 -tol 1.e-6]
|
|
set inter3 [2dintersect c1 c4 -tol 1.e-6]
|
|
set inter4 [2dintersect c3 c4 -tol 1.e-6]
|
|
set int1 [regexp {Intersection point 1} $inter1]
|
|
set int2 [regexp {Intersection point 1} $inter2]
|
|
set int3 [regexp {Intersection point 1} $inter3]
|
|
set int4 [regexp {Intersection point 1} $inter4]
|
|
|
|
if { $int1 == 0 || $int2 == 0 || $int3 == 0 || $int4 ==0 } {
|
|
puts "Error : Intersection is not found"
|
|
}
|
|
|
|
av2d
|
|
2dfit
|
|
|
|
xwd ${imagedir}/${test_image}.png
|