mirror of
https://git.dev.opencascade.org/repos/occt.git
synced 2025-04-10 18:51:21 +03:00
b6cf8ffa35
1. When computing the iso-lines for the face (*DBRep_IsoBuilder*) prepare the Hatching algorithm with the following elements: a. Trimmed p-curves of edges. The trimming parameters are computed by intersection with p-curves of the neighboring edges. The trimming will be performed only if the intersection point is covered by the tolerance of common vertex. b. 2D segments connecting the p-curves of the neighboring edges. These segments will close the 2D gaps, which are closed in 3D by the tolerance of vertices shared between edges. This will allow trimming correctly the iso-lines passing through such gaps. 2. Implementation of the additional Init() method for WireExplorer algorithm taking UV bounds of the face to avoid their repeated computation when work working with a face having multiple wires. 3. Test cases for the issue.
23 lines
449 B
Plaintext
Executable File
23 lines
449 B
Plaintext
Executable File
DBRep.cxx
|
|
DBRep.hxx
|
|
DBRep_Debug.cxx
|
|
DBRep_DrawableShape.cxx
|
|
DBRep_DrawableShape.hxx
|
|
DBRep_Edge.cxx
|
|
DBRep_Edge.hxx
|
|
DBRep_Edge.lxx
|
|
DBRep_Face.cxx
|
|
DBRep_Face.hxx
|
|
DBRep_Face.lxx
|
|
DBRep_HideData.cxx
|
|
DBRep_HideData.hxx
|
|
DBRep_HideData.lxx
|
|
DBRep_IsoBuilder.cxx
|
|
DBRep_IsoBuilder.hxx
|
|
DBRep_ListIteratorOfListOfEdge.hxx
|
|
DBRep_ListIteratorOfListOfFace.hxx
|
|
DBRep_ListIteratorOfListOfHideData.hxx
|
|
DBRep_ListOfEdge.hxx
|
|
DBRep_ListOfFace.hxx
|
|
DBRep_ListOfHideData.hxx
|