Anonymous | Login | 2019-08-20 01:21 MSK |

My View | View Issues | Change Log | Roadmap |

occt: master 4dba155d | [ Diff ] [ Back to Repository ] | |||

Author | Committer | Branch | Timestamp | Parent |

nbv | apn | master | 2016-11-24 12:07:52 | master fcfda039 |

Affected Issues | 0025187: Document the algorithm used in the fixes for issues #0024915 and #0025194 | |||

Changeset | 0025187: Document the algorithm used in the fixes for issues ## 0024915 and 25194 1. Algorithm of orthogonalize of the transformation matrix (in gp_Trsf(2d) classes) has been documented. 2. Algorithm of computation of intersection line in case of two intersected cylinders (implemented in the fix for issue #24915) has been documented. Additionally, I would like to tell about some advantages of new algorithm in compare with old one. 2.1. Both algorithm generates intersection points for Walking-line (WL), which will be approximated to B-spline curve(s) in the future. At that, new algo (in compare with old one) uses another method for step computation. It based on attempts to provide equal steps (if it is possible) along V-direction (instead of U-direction used in old algorithm). It allows obtaining set of points, which are more uniform distributed in compare with old algo (this problem is the main reason why case #24915 was failed). Of course, we will get non-uniform distribution along U-direction. However, it can be compensated by small range (its length is less or equal 2*PI) of U-parameter change, whereas range of V-parameter can be very big. 2.2. More simple estimation of curvature "jump". New algo aims at provide equidistant distribution of points along V-direction. If it requires "jump" of U-parameter then we have "jump" of curvature in this point. This check is implemented in function AddPointIntoWL(...) (see place where SeekAdditionalPoints(...) is called). However, in OCCT 7.1.0, curvature jumping is analyzed (it was not earlier, when the bug #24915 was fixed) - see fix for issue #27431. 2.3. New algorithm allows obtaining 7D-intersection point immediately. At that, old algorithm computed only 2D-intersection point (on some one surface). After that, it computed 3D-intersection point and, finally, projected(!) 3D-point to the second surface in order to obtain second 2D-intersection point. This second projection results in some problems. One problem is described in the issue #27968 (see message ~0058807). Second problem is the process of cases with singularity (significant improvement in this direction has been made in the fix #27431). Third problem is difficulties in projection itself (e.g. if we project point to a sphere when V-coordinate of the projection is near to PI/2 - projection point is found but not precise; the reason is not singularity but small radius of V-isoline). Method used in new algorithm allows avoiding these problems. However, at present, it is implemented for case of two cylinders intersection (where most of these problems are not actual). 2.4. Algorithm of search of intersection point on surface boundary(ies) has been changed, too. Old algorithm sought point on boundary irrespective of intersection line. It resulted in problems described in the issue 0027252 and related. New algorithm looks for intersection point of intersection line with surface boundary. It requires rectangular domain. However, it is not problem for current OCCT-version. |
|||

mod - src/gp/gp_Trsf.cxx | [ Diff ] [ File ] | |||

mod - src/gp/gp_Trsf2d.cxx | [ Diff ] [ File ] | |||

mod - src/IntPatch/IntPatch_ImpImpIntersection_4.gxx | [ Diff ] [ File ] |

Copyright © 2000 - 2019 MantisBT Team |