mirror of
https://git.dev.opencascade.org/repos/occt.git
synced 2025-04-09 18:50:54 +03:00
68b0769935
The following improvements have been made: 1. Linking edges to triangles while creating the edges. 2. Replacing the array of couples of intersecting triangles with the list to avoid unnecessary allocations of memory. 3. Using the algorithm of unbalanced binary tree when looking for pairs of interfering triangles. 4. Building bounding boxes for the triangles only once and then reusing it. 5. Making the simple methods of the IntPolyh_Point, IntPolyh_Edge, IntPolyh_Triangle, IntPolyh_Couple classes inline. 6. The following methods of the *IntPolyh_Triangle* class have been removed as unused: - *CheckCommonEdge* - *SetEdgeandOrientation* - *MultipleMiddleRefinement2*. 7. The method *IntPolyh_Triangle::TriangleDeflection* has been replaced with the *IntPolyh_Triangle::ComputeDeflection*. 8. The following methods of the *IntPolyh_MaillageAffinage* class have been removed as unused: - *LinkEdges2Triangles*; - *TriangleEdgeContact2*; - *StartingPointsResearch2*; - *NextStartingPointsResearch2*; - *TriangleComparePSP*; - *StartPointsCalcul*.
27 lines
680 B
Plaintext
Executable File
27 lines
680 B
Plaintext
Executable File
IntPolyh_Array.hxx
|
|
IntPolyh_ArrayOfEdges.hxx
|
|
IntPolyh_ArrayOfPoints.hxx
|
|
IntPolyh_ArrayOfSectionLines.hxx
|
|
IntPolyh_ArrayOfTangentZones.hxx
|
|
IntPolyh_ArrayOfTriangles.hxx
|
|
IntPolyh_Couple.cxx
|
|
IntPolyh_Couple.hxx
|
|
IntPolyh_CoupleMapHasher.hxx
|
|
IntPolyh_Edge.cxx
|
|
IntPolyh_Edge.hxx
|
|
IntPolyh_Intersection.cxx
|
|
IntPolyh_Intersection.hxx
|
|
IntPolyh_Intersection_1.cxx
|
|
IntPolyh_ListOfCouples.hxx
|
|
IntPolyh_MaillageAffinage.cxx
|
|
IntPolyh_MaillageAffinage.hxx
|
|
IntPolyh_PMaillageAffinage.hxx
|
|
IntPolyh_Point.cxx
|
|
IntPolyh_Point.hxx
|
|
IntPolyh_SectionLine.cxx
|
|
IntPolyh_SectionLine.hxx
|
|
IntPolyh_SeqOfStartPoints.hxx
|
|
IntPolyh_StartPoint.cxx
|
|
IntPolyh_StartPoint.hxx
|
|
IntPolyh_Triangle.cxx
|
|
IntPolyh_Triangle.hxx |