973c2be1 |
1 | // Created on: 1993-09-23 |
2 | // Created by: Jean-Louis FRENKEL |
3 | // Copyright (c) 1993-1999 Matra Datavision |
4 | // Copyright (c) 1999-2014 OPEN CASCADE SAS |
5 | // |
6 | // This file is part of Open CASCADE Technology software library. |
7 | // |
d5f74e42 |
8 | // This library is free software; you can redistribute it and/or modify it under |
9 | // the terms of the GNU Lesser General Public License version 2.1 as published |
973c2be1 |
10 | // by the Free Software Foundation, with special exception defined in the file |
11 | // OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT |
12 | // distribution for complete text of the license and disclaimer of any warranty. |
13 | // |
14 | // Alternatively, this file may be used under the terms of Open CASCADE |
15 | // commercial license or contractual agreement. |
2bd4c032 |
16 | |
17 | #include <StdPrs_ShadedShape.hxx> |
18 | |
19 | #include <Bnd_Box.hxx> |
20 | #include <BRep_Builder.hxx> |
21 | #include <BRepBndLib.hxx> |
22 | #include <BRepMesh_DiscretFactory.hxx> |
23 | #include <BRepMesh_DiscretRoot.hxx> |
24 | #include <BRepTools.hxx> |
31c0e219 |
25 | #include <Graphic3d_ArrayOfSegments.hxx> |
2bd4c032 |
26 | #include <Graphic3d_ArrayOfTriangles.hxx> |
27 | #include <Graphic3d_AspectFillArea3d.hxx> |
28 | #include <Graphic3d_Group.hxx> |
29 | #include <gp_Dir.hxx> |
30 | #include <gp_Vec.hxx> |
31 | #include <gp_Pnt.hxx> |
31c0e219 |
32 | #include <NCollection_List.hxx> |
2bd4c032 |
33 | #include <Precision.hxx> |
9dba391d |
34 | #include <Prs3d.hxx> |
2bd4c032 |
35 | #include <Prs3d_Drawer.hxx> |
4c513386 |
36 | #include <Prs3d_IsoAspect.hxx> |
31c0e219 |
37 | #include <Prs3d_LineAspect.hxx> |
2bd4c032 |
38 | #include <Prs3d_Presentation.hxx> |
39 | #include <Prs3d_ShadingAspect.hxx> |
40 | #include <Poly_Connect.hxx> |
31c0e219 |
41 | #include <Poly_PolygonOnTriangulation.hxx> |
2bd4c032 |
42 | #include <Poly_Triangulation.hxx> |
43 | #include <StdPrs_ToolShadedShape.hxx> |
4c513386 |
44 | #include <StdPrs_WFDeflectionShape.hxx> |
2bd4c032 |
45 | #include <StdPrs_WFShape.hxx> |
31c0e219 |
46 | #include <TopExp.hxx> |
fc9b36d6 |
47 | #include <TopExp_Explorer.hxx> |
48 | #include <TopoDS.hxx> |
31c0e219 |
49 | #include <TopoDS_Compound.hxx> |
2bd4c032 |
50 | #include <TopoDS_Face.hxx> |
31c0e219 |
51 | #include <TopoDS_Shape.hxx> |
2bd4c032 |
52 | #include <TColgp_Array1OfDir.hxx> |
53 | #include <TColgp_Array1OfPnt2d.hxx> |
31c0e219 |
54 | #include <TColgp_HArray1OfPnt.hxx> |
a2d5ab2e |
55 | #include <TopTools_ListOfShape.hxx> |
56 | #include <TopTools_IndexedDataMapOfShapeListOfShape.hxx> |
2bd4c032 |
57 | |
58 | namespace |
59 | { |
31c0e219 |
60 | |
61 | //! Computes wireframe presentation for free wires and vertices |
62 | void wireframeFromShape (const Handle (Prs3d_Presentation)& thePrs, |
63 | const TopoDS_Shape& theShape, |
64 | const Handle (Prs3d_Drawer)& theDrawer) |
65 | { |
53b15292 |
66 | Standard_Boolean aDrawAllVerticesFlag = (theDrawer->VertexDrawMode() == Prs3d_VDM_All); |
67 | |
68 | if (!aDrawAllVerticesFlag && theShape.ShapeType() != TopAbs_COMPOUND) |
31c0e219 |
69 | { |
70 | return; |
71 | } |
72 | |
73 | TopExp_Explorer aShapeIter (theShape, TopAbs_FACE); |
74 | if (!aShapeIter.More()) |
75 | { |
76 | // compound contains no shaded elements at all |
7f917335 |
77 | StdPrs_WFDeflectionShape::Add (thePrs, theShape, theDrawer); |
31c0e219 |
78 | return; |
79 | } |
80 | |
53b15292 |
81 | // We have to create a compound and collect all subshapes not drawn by the shading algo. |
82 | // This includes: |
83 | // - isolated edges |
84 | // - isolated vertices, if aDrawAllVerticesFlag == Standard_False |
85 | // - all shape's vertices, if aDrawAllVerticesFlag == Standard_True |
31c0e219 |
86 | TopoDS_Compound aCompoundWF; |
87 | BRep_Builder aBuilder; |
88 | aBuilder.MakeCompound (aCompoundWF); |
89 | Standard_Boolean hasElement = Standard_False; |
90 | |
91 | // isolated edges |
92 | for (aShapeIter.Init (theShape, TopAbs_EDGE, TopAbs_FACE); aShapeIter.More(); aShapeIter.Next()) |
93 | { |
94 | hasElement = Standard_True; |
95 | aBuilder.Add (aCompoundWF, aShapeIter.Current()); |
96 | } |
53b15292 |
97 | // isolated or all vertices |
98 | aShapeIter.Init (theShape, TopAbs_VERTEX, aDrawAllVerticesFlag ? TopAbs_SHAPE : TopAbs_EDGE); |
99 | for (; aShapeIter.More(); aShapeIter.Next()) |
31c0e219 |
100 | { |
101 | hasElement = Standard_True; |
102 | aBuilder.Add (aCompoundWF, aShapeIter.Current()); |
103 | } |
104 | if (hasElement) |
105 | { |
7f917335 |
106 | StdPrs_WFDeflectionShape::Add (thePrs, aCompoundWF, theDrawer); |
31c0e219 |
107 | } |
108 | } |
109 | |
4c513386 |
110 | //! Computes special wireframe presentation for faces without triangulation. |
111 | void wireframeNoTriangFacesFromShape (const Handle(Prs3d_Presentation)& thePrs, |
112 | const TopoDS_Shape& theShape, |
113 | const Handle(Prs3d_Drawer)& theDrawer) |
114 | { |
115 | TopoDS_Compound aCompoundWF; |
116 | BRep_Builder aBuilder; |
117 | aBuilder.MakeCompound (aCompoundWF); |
118 | TopLoc_Location aLoc; |
119 | Standard_Boolean hasElement = Standard_False; |
120 | |
121 | for (TopExp_Explorer aShapeIter(theShape, TopAbs_FACE); aShapeIter.More(); aShapeIter.Next()) |
122 | { |
123 | const TopoDS_Face& aFace = TopoDS::Face (aShapeIter.Current()); |
124 | const Handle(Poly_Triangulation) aTriang = BRep_Tool::Triangulation (aFace, aLoc); |
125 | if (aTriang.IsNull()) |
126 | { |
127 | hasElement = Standard_True; |
128 | aBuilder.Add (aCompoundWF, aFace); |
129 | } |
130 | } |
131 | |
132 | if (hasElement) |
133 | { |
134 | Standard_Integer aPrevUIsoNb = theDrawer->UIsoAspect()->Number(); |
135 | Standard_Integer aPrevVIsoNb = theDrawer->VIsoAspect()->Number(); |
136 | theDrawer->UIsoAspect()->SetNumber (5); |
137 | theDrawer->VIsoAspect()->SetNumber (5); |
138 | |
139 | StdPrs_WFDeflectionShape::Add (thePrs, aCompoundWF, theDrawer); |
140 | |
141 | theDrawer->UIsoAspect()->SetNumber (aPrevUIsoNb); |
142 | theDrawer->VIsoAspect()->SetNumber (aPrevVIsoNb); |
143 | } |
144 | } |
145 | |
31c0e219 |
146 | //! Gets triangulation of every face of shape and fills output array of triangles |
147 | static Handle(Graphic3d_ArrayOfTriangles) fillTriangles (const TopoDS_Shape& theShape, |
148 | const Standard_Boolean theHasTexels, |
149 | const gp_Pnt2d& theUVOrigin, |
150 | const gp_Pnt2d& theUVRepeat, |
151 | const gp_Pnt2d& theUVScale) |
2bd4c032 |
152 | { |
31c0e219 |
153 | Handle(Poly_Triangulation) aT; |
2bd4c032 |
154 | TopLoc_Location aLoc; |
31c0e219 |
155 | gp_Pnt aPoint; |
156 | Standard_Integer aNbTriangles = 0; |
157 | Standard_Integer aNbVertices = 0; |
2bd4c032 |
158 | |
31c0e219 |
159 | // Precision for compare square distances |
3b1817a9 |
160 | const Standard_Real aPreci = Precision::SquareConfusion(); |
2bd4c032 |
161 | |
fc9b36d6 |
162 | TopExp_Explorer aFaceIt(theShape, TopAbs_FACE); |
163 | for (; aFaceIt.More(); aFaceIt.Next()) |
2bd4c032 |
164 | { |
fc9b36d6 |
165 | const TopoDS_Face& aFace = TopoDS::Face(aFaceIt.Current()); |
166 | aT = StdPrs_ToolShadedShape::Triangulation (aFace, aLoc); |
31c0e219 |
167 | if (!aT.IsNull()) |
2bd4c032 |
168 | { |
31c0e219 |
169 | aNbTriangles += aT->NbTriangles(); |
170 | aNbVertices += aT->NbNodes(); |
2bd4c032 |
171 | } |
2bd4c032 |
172 | } |
31c0e219 |
173 | if (aNbVertices < 3 || aNbTriangles <= 0) |
2bd4c032 |
174 | { |
31c0e219 |
175 | return Handle(Graphic3d_ArrayOfTriangles)(); |
3b1817a9 |
176 | } |
2bd4c032 |
177 | |
31c0e219 |
178 | Handle(Graphic3d_ArrayOfTriangles) anArray = new Graphic3d_ArrayOfTriangles (aNbVertices, 3 * aNbTriangles, |
871fa103 |
179 | Standard_True, Standard_False, theHasTexels); |
31c0e219 |
180 | Standard_Real aUmin (0.0), aUmax (0.0), aVmin (0.0), aVmax (0.0), dUmax (0.0), dVmax (0.0); |
fc9b36d6 |
181 | for (aFaceIt.Init (theShape, TopAbs_FACE); aFaceIt.More(); aFaceIt.Next()) |
2bd4c032 |
182 | { |
fc9b36d6 |
183 | const TopoDS_Face& aFace = TopoDS::Face(aFaceIt.Current()); |
184 | aT = StdPrs_ToolShadedShape::Triangulation (aFace, aLoc); |
31c0e219 |
185 | if (aT.IsNull()) |
3b1817a9 |
186 | { |
187 | continue; |
188 | } |
189 | const gp_Trsf& aTrsf = aLoc.Transformation(); |
7d9e854b |
190 | |
191 | // Determinant of transform matrix less then 0 means that mirror transform applied. |
192 | Standard_Boolean isMirrored = aTrsf.VectorialPart().Determinant() < 0; |
193 | |
31c0e219 |
194 | Poly_Connect aPolyConnect (aT); |
3b1817a9 |
195 | // Extracts vertices & normals from nodes |
31c0e219 |
196 | const TColgp_Array1OfPnt& aNodes = aT->Nodes(); |
197 | const TColgp_Array1OfPnt2d& aUVNodes = aT->UVNodes(); |
3b1817a9 |
198 | TColgp_Array1OfDir aNormals (aNodes.Lower(), aNodes.Upper()); |
fc9b36d6 |
199 | StdPrs_ToolShadedShape::Normal (aFace, aPolyConnect, aNormals); |
3b1817a9 |
200 | |
201 | if (theHasTexels) |
2bd4c032 |
202 | { |
3b1817a9 |
203 | BRepTools::UVBounds (aFace, aUmin, aUmax, aVmin, aVmax); |
204 | dUmax = (aUmax - aUmin); |
205 | dVmax = (aVmax - aVmin); |
206 | } |
207 | |
31c0e219 |
208 | const Standard_Integer aDecal = anArray->VertexNumber(); |
3b1817a9 |
209 | for (Standard_Integer aNodeIter = aNodes.Lower(); aNodeIter <= aNodes.Upper(); ++aNodeIter) |
210 | { |
31c0e219 |
211 | aPoint = aNodes (aNodeIter); |
3b1817a9 |
212 | if (!aLoc.IsIdentity()) |
2bd4c032 |
213 | { |
31c0e219 |
214 | aPoint.Transform (aTrsf); |
7d9e854b |
215 | |
216 | aNormals (aNodeIter) = aNormals (aNodeIter).Transformed (aTrsf); |
2bd4c032 |
217 | } |
3b1817a9 |
218 | |
219 | if (theHasTexels && aUVNodes.Upper() == aNodes.Upper()) |
2bd4c032 |
220 | { |
3b1817a9 |
221 | const gp_Pnt2d aTexel = gp_Pnt2d ((-theUVOrigin.X() + (theUVRepeat.X() * (aUVNodes (aNodeIter).X() - aUmin)) / dUmax) / theUVScale.X(), |
222 | (-theUVOrigin.Y() + (theUVRepeat.Y() * (aUVNodes (aNodeIter).Y() - aVmin)) / dVmax) / theUVScale.Y()); |
31c0e219 |
223 | anArray->AddVertex (aPoint, aNormals (aNodeIter), aTexel); |
2bd4c032 |
224 | } |
3b1817a9 |
225 | else |
2bd4c032 |
226 | { |
31c0e219 |
227 | anArray->AddVertex (aPoint, aNormals (aNodeIter)); |
2bd4c032 |
228 | } |
3b1817a9 |
229 | } |
2bd4c032 |
230 | |
3b1817a9 |
231 | // Fill array with vertex and edge visibility info |
31c0e219 |
232 | const Poly_Array1OfTriangle& aTriangles = aT->Triangles(); |
233 | Standard_Integer anIndex[3]; |
234 | for (Standard_Integer aTriIter = 1; aTriIter <= aT->NbTriangles(); ++aTriIter) |
3b1817a9 |
235 | { |
7d9e854b |
236 | if ((aFace.Orientation() == TopAbs_REVERSED) ^ isMirrored) |
31c0e219 |
237 | { |
238 | aTriangles (aTriIter).Get (anIndex[0], anIndex[2], anIndex[1]); |
239 | } |
3b1817a9 |
240 | else |
31c0e219 |
241 | { |
242 | aTriangles (aTriIter).Get (anIndex[0], anIndex[1], anIndex[2]); |
243 | } |
3b1817a9 |
244 | |
31c0e219 |
245 | gp_Pnt aP1 = aNodes (anIndex[0]); |
246 | gp_Pnt aP2 = aNodes (anIndex[1]); |
247 | gp_Pnt aP3 = aNodes (anIndex[2]); |
3b1817a9 |
248 | |
31c0e219 |
249 | gp_Vec aV1 (aP1, aP2); |
250 | if (aV1.SquareMagnitude() <= aPreci) |
3b1817a9 |
251 | { |
252 | continue; |
253 | } |
31c0e219 |
254 | gp_Vec aV2 (aP2, aP3); |
255 | if (aV2.SquareMagnitude() <= aPreci) |
3b1817a9 |
256 | { |
257 | continue; |
258 | } |
31c0e219 |
259 | gp_Vec aV3 (aP3, aP1); |
260 | if (aV3.SquareMagnitude() <= aPreci) |
3b1817a9 |
261 | { |
262 | continue; |
263 | } |
31c0e219 |
264 | aV1.Normalize(); |
265 | aV2.Normalize(); |
266 | aV1.Cross (aV2); |
267 | if (aV1.SquareMagnitude() > aPreci) |
2bd4c032 |
268 | { |
31c0e219 |
269 | anArray->AddEdge (anIndex[0] + aDecal); |
270 | anArray->AddEdge (anIndex[1] + aDecal); |
271 | anArray->AddEdge (anIndex[2] + aDecal); |
2bd4c032 |
272 | } |
273 | } |
2bd4c032 |
274 | } |
31c0e219 |
275 | return anArray; |
276 | } |
277 | |
31c0e219 |
278 | //! Prepare shaded presentation for specified shape |
279 | static Standard_Boolean shadeFromShape (const TopoDS_Shape& theShape, |
280 | const Handle(Prs3d_Presentation)& thePrs, |
281 | const Handle(Prs3d_Drawer)& theDrawer, |
282 | const Standard_Boolean theHasTexels, |
283 | const gp_Pnt2d& theUVOrigin, |
284 | const gp_Pnt2d& theUVRepeat, |
285 | const gp_Pnt2d& theUVScale, |
286 | const Standard_Boolean theIsClosed) |
287 | { |
288 | Handle(Graphic3d_ArrayOfTriangles) aPArray = fillTriangles (theShape, theHasTexels, theUVOrigin, theUVRepeat, theUVScale); |
289 | if (aPArray.IsNull()) |
290 | { |
291 | return Standard_False; |
292 | } |
3b1817a9 |
293 | |
31c0e219 |
294 | Handle(Graphic3d_Group) aGroup = Prs3d_Root::NewGroup (thePrs); |
295 | aGroup->SetClosed (theIsClosed); |
296 | if (!theDrawer->ShadingAspectGlobal()) |
297 | { |
298 | Handle(Graphic3d_AspectFillArea3d) anAsp = theDrawer->ShadingAspect()->Aspect(); |
299 | theIsClosed ? anAsp->SuppressBackFace() : anAsp->AllowBackFace(); |
300 | aGroup->SetGroupPrimitivesAspect (anAsp); |
301 | } |
302 | aGroup->AddPrimitiveArray (aPArray); |
2bd4c032 |
303 | return Standard_True; |
304 | } |
a2d5ab2e |
305 | |
31c0e219 |
306 | //! Compute boundary presentation for faces of the shape. |
307 | static void computeFaceBoundaries (const TopoDS_Shape& theShape, |
308 | const Handle(Prs3d_Presentation)& thePrs, |
309 | const Handle(Prs3d_Drawer)& theDrawer) |
a2d5ab2e |
310 | { |
311 | // collection of all triangulation nodes on edges |
312 | // for computing boundaries presentation |
313 | NCollection_List<Handle(TColgp_HArray1OfPnt)> aNodeCollection; |
314 | Standard_Integer aNodeNumber = 0; |
315 | |
316 | TopLoc_Location aTrsf; |
317 | |
318 | // explore all boundary edges |
319 | TopTools_IndexedDataMapOfShapeListOfShape anEdgesMap; |
320 | TopExp::MapShapesAndAncestors ( |
321 | theShape, TopAbs_EDGE, TopAbs_FACE, anEdgesMap); |
322 | |
323 | Standard_Integer anEdgeIdx = 1; |
324 | for ( ; anEdgeIdx <= anEdgesMap.Extent (); anEdgeIdx++) |
325 | { |
326 | // reject free edges |
327 | const TopTools_ListOfShape& aFaceList = anEdgesMap.FindFromIndex (anEdgeIdx); |
328 | if (aFaceList.Extent() == 0) |
329 | continue; |
330 | |
331 | // take one of the shared edges and get edge triangulation |
332 | const TopoDS_Face& aFace = TopoDS::Face (aFaceList.First ()); |
333 | const TopoDS_Edge& anEdge = TopoDS::Edge (anEdgesMap.FindKey (anEdgeIdx)); |
334 | |
335 | Handle(Poly_Triangulation) aTriangulation = |
336 | BRep_Tool::Triangulation (aFace, aTrsf); |
337 | |
338 | if (aTriangulation.IsNull ()) |
339 | continue; |
340 | |
341 | Handle(Poly_PolygonOnTriangulation) anEdgePoly = |
342 | BRep_Tool::PolygonOnTriangulation (anEdge, aTriangulation, aTrsf); |
343 | |
344 | if (anEdgePoly.IsNull ()) |
345 | continue; |
346 | |
347 | // get edge nodes indexes from face triangulation |
348 | const TColgp_Array1OfPnt& aTriNodes = aTriangulation->Nodes (); |
349 | const TColStd_Array1OfInteger& anEdgeNodes = anEdgePoly->Nodes (); |
350 | |
351 | if (anEdgeNodes.Length () < 2) |
352 | continue; |
353 | |
354 | // collect the edge nodes |
355 | Handle(TColgp_HArray1OfPnt) aCollected = |
356 | new TColgp_HArray1OfPnt (anEdgeNodes.Lower (), anEdgeNodes.Upper ()); |
357 | |
358 | Standard_Integer aNodeIdx = anEdgeNodes.Lower (); |
359 | for ( ; aNodeIdx <= anEdgeNodes.Upper (); aNodeIdx++) |
360 | { |
361 | // node index in face triangulation |
362 | Standard_Integer aTriIndex = anEdgeNodes.Value (aNodeIdx); |
363 | |
364 | // get node and apply location transformation to the node |
365 | gp_Pnt aTriNode = aTriNodes.Value (aTriIndex); |
366 | if (!aTrsf.IsIdentity ()) |
367 | aTriNode.Transform (aTrsf); |
368 | |
369 | // add node to the boundary array |
370 | aCollected->SetValue (aNodeIdx, aTriNode); |
371 | } |
372 | |
373 | aNodeNumber += anEdgeNodes.Length (); |
374 | aNodeCollection.Append (aCollected); |
375 | } |
376 | |
377 | // check if it possible to continue building the presentation |
378 | if (aNodeNumber == 0) |
379 | return; |
380 | |
381 | // allocate polyline array for presentation |
382 | Standard_Integer aSegmentEdgeNb = |
383 | (aNodeNumber - aNodeCollection.Extent()) * 2; |
384 | |
385 | Handle(Graphic3d_ArrayOfSegments) aSegments = |
386 | new Graphic3d_ArrayOfSegments (aNodeNumber, aSegmentEdgeNb); |
387 | |
388 | // build presentation for edge bondaries |
389 | NCollection_List<Handle(TColgp_HArray1OfPnt)>::Iterator |
390 | aCollIt (aNodeCollection); |
391 | |
392 | // the edge index is increased in each iteration step to |
393 | // avoid contiguous segments between different face edges. |
394 | for ( ; aCollIt.More(); aCollIt.Next () ) |
395 | { |
396 | const Handle(TColgp_HArray1OfPnt)& aNodeArray = aCollIt.Value (); |
397 | |
398 | Standard_Integer aNodeIdx = aNodeArray->Lower (); |
399 | |
400 | // add first node (this node is not shared with previous segment). |
401 | // for each face edge, indices for sharing nodes |
402 | // between segments begin from the first added node. |
403 | Standard_Integer aSegmentEdge = |
404 | aSegments->AddVertex (aNodeArray->Value (aNodeIdx)); |
405 | |
406 | // add subsequent nodes and provide edge indexes for sharing |
407 | // the nodes between the sequential segments. |
408 | for ( aNodeIdx++; aNodeIdx <= aNodeArray->Upper (); aNodeIdx++ ) |
409 | { |
410 | aSegments->AddVertex (aNodeArray->Value (aNodeIdx)); |
411 | aSegments->AddEdge ( aSegmentEdge); |
412 | aSegments->AddEdge (++aSegmentEdge); |
413 | } |
414 | } |
415 | |
416 | // set up aspect and add polyline data |
417 | Handle(Graphic3d_AspectLine3d) aBoundaryAspect = |
418 | theDrawer->FaceBoundaryAspect ()->Aspect (); |
419 | |
31c0e219 |
420 | Handle(Graphic3d_Group) aPrsGrp = Prs3d_Root::CurrentGroup (thePrs); |
a2d5ab2e |
421 | aPrsGrp->SetGroupPrimitivesAspect (aBoundaryAspect); |
a2d5ab2e |
422 | aPrsGrp->AddPrimitiveArray (aSegments); |
a2d5ab2e |
423 | } |
2bd4c032 |
424 | }; |
425 | |
5bffb882 |
426 | // ======================================================================= |
427 | // function : ExploreSolids |
428 | // purpose : |
429 | // ======================================================================= |
430 | void StdPrs_ShadedShape::ExploreSolids (const TopoDS_Shape& theShape, |
431 | const BRep_Builder& theBuilder, |
432 | TopoDS_Compound& theClosed, |
433 | TopoDS_Compound& theOpened, |
434 | const Standard_Boolean theIgnore1DSubShape) |
435 | { |
436 | if (theShape.IsNull()) |
437 | { |
438 | return; |
439 | } |
440 | |
441 | switch (theShape.ShapeType()) |
442 | { |
443 | case TopAbs_COMPOUND: |
444 | case TopAbs_COMPSOLID: |
445 | { |
446 | for (TopoDS_Iterator anIter (theShape); anIter.More(); anIter.Next()) |
447 | { |
448 | ExploreSolids (anIter.Value(), theBuilder, theClosed, theOpened, theIgnore1DSubShape); |
449 | } |
450 | return; |
451 | } |
452 | case TopAbs_SOLID: |
453 | { |
454 | for (TopoDS_Iterator anIter (theShape); anIter.More(); anIter.Next()) |
455 | { |
456 | const TopoDS_Shape& aSubShape = anIter.Value(); |
457 | const Standard_Boolean isClosed = aSubShape.ShapeType() == TopAbs_SHELL && |
458 | BRep_Tool::IsClosed (aSubShape) && |
459 | StdPrs_ToolShadedShape::IsTriangulated (aSubShape); |
460 | theBuilder.Add (isClosed ? theClosed : theOpened, aSubShape); |
461 | } |
462 | return; |
463 | } |
464 | case TopAbs_SHELL: |
465 | case TopAbs_FACE: |
466 | { |
467 | theBuilder.Add (theOpened, theShape); |
468 | return; |
469 | } |
470 | case TopAbs_WIRE: |
471 | case TopAbs_EDGE: |
472 | case TopAbs_VERTEX: |
473 | { |
474 | if (!theIgnore1DSubShape) |
475 | { |
476 | theBuilder.Add (theOpened, theShape); |
477 | } |
478 | return; |
479 | } |
480 | case TopAbs_SHAPE: |
481 | default: |
482 | return; |
483 | } |
484 | } |
485 | |
2bd4c032 |
486 | // ======================================================================= |
487 | // function : Add |
488 | // purpose : |
489 | // ======================================================================= |
31c0e219 |
490 | void StdPrs_ShadedShape::Add (const Handle(Prs3d_Presentation)& thePrs, |
491 | const TopoDS_Shape& theShape, |
492 | const Handle(Prs3d_Drawer)& theDrawer, |
5bffb882 |
493 | const StdPrs_Volume theVolume) |
2bd4c032 |
494 | { |
495 | gp_Pnt2d aDummy; |
31c0e219 |
496 | StdPrs_ShadedShape::Add (thePrs, theShape, theDrawer, |
5bffb882 |
497 | Standard_False, aDummy, aDummy, aDummy, theVolume); |
2bd4c032 |
498 | } |
499 | |
ad3217cd |
500 | // ======================================================================= |
501 | // function : Tessellate |
502 | // purpose : |
503 | // ======================================================================= |
504 | void StdPrs_ShadedShape::Tessellate (const TopoDS_Shape& theShape, |
505 | const Handle (Prs3d_Drawer)& theDrawer) |
506 | { |
31c0e219 |
507 | // Check if it is possible to avoid unnecessary recomputation of shape triangulation |
9dba391d |
508 | Standard_Real aDeflection = Prs3d::GetDeflection (theShape, theDrawer); |
ad3217cd |
509 | if (BRepTools::Triangulation (theShape, aDeflection)) |
510 | { |
511 | return; |
512 | } |
513 | |
514 | // retrieve meshing tool from Factory |
ad3217cd |
515 | Handle(BRepMesh_DiscretRoot) aMeshAlgo = BRepMesh_DiscretFactory::Get().Discret (theShape, |
516 | aDeflection, |
517 | theDrawer->HLRAngle()); |
518 | if (!aMeshAlgo.IsNull()) |
519 | { |
520 | aMeshAlgo->Perform(); |
521 | } |
522 | } |
523 | |
2bd4c032 |
524 | // ======================================================================= |
525 | // function : Add |
526 | // purpose : |
527 | // ======================================================================= |
31c0e219 |
528 | void StdPrs_ShadedShape::Add (const Handle (Prs3d_Presentation)& thePrs, |
2bd4c032 |
529 | const TopoDS_Shape& theShape, |
530 | const Handle (Prs3d_Drawer)& theDrawer, |
531 | const Standard_Boolean theHasTexels, |
532 | const gp_Pnt2d& theUVOrigin, |
533 | const gp_Pnt2d& theUVRepeat, |
31c0e219 |
534 | const gp_Pnt2d& theUVScale, |
5bffb882 |
535 | const StdPrs_Volume theVolume) |
2bd4c032 |
536 | { |
537 | if (theShape.IsNull()) |
538 | { |
539 | return; |
540 | } |
541 | |
31c0e219 |
542 | // add wireframe presentation for isolated edges and vertices |
543 | wireframeFromShape (thePrs, theShape, theDrawer); |
544 | |
4c513386 |
545 | // Use automatic re-triangulation with deflection-check logic only if this feature is enable |
546 | if (theDrawer->IsAutoTriangulation()) |
547 | { |
548 | // Triangulation completeness is important for "open-closed" analysis - perform tessellation beforehand |
549 | Tessellate (theShape, theDrawer); |
550 | } |
551 | |
552 | // add special wireframe presentation for faces without triangulation |
553 | wireframeNoTriangFacesFromShape (thePrs, theShape, theDrawer); |
4769a395 |
554 | |
555 | // The shape types listed below need advanced analysis as potentially containing |
556 | // both closed and open parts. Solids are also included, because they might |
557 | // contain non-manifold parts inside (internal open shells) |
31c0e219 |
558 | if ((theShape.ShapeType() == TopAbs_COMPOUND |
4769a395 |
559 | || theShape.ShapeType() == TopAbs_COMPSOLID |
560 | || theShape.ShapeType() == TopAbs_SOLID) |
5bffb882 |
561 | && theVolume == StdPrs_Volume_Autodetection) |
2bd4c032 |
562 | { |
31c0e219 |
563 | // collect two compounds: for opened and closed (solid) sub-shapes |
564 | TopoDS_Compound anOpened, aClosed; |
565 | BRep_Builder aBuilder; |
566 | aBuilder.MakeCompound (aClosed); |
567 | aBuilder.MakeCompound (anOpened); |
5bffb882 |
568 | ExploreSolids (theShape, aBuilder, aClosed, anOpened, Standard_True); |
31c0e219 |
569 | |
570 | TopoDS_Iterator aShapeIter (aClosed); |
571 | if (aShapeIter.More()) |
2bd4c032 |
572 | { |
31c0e219 |
573 | shadeFromShape (aClosed, thePrs, theDrawer, |
574 | theHasTexels, theUVOrigin, theUVRepeat, theUVScale, Standard_True); |
2bd4c032 |
575 | } |
31c0e219 |
576 | |
577 | aShapeIter.Initialize (anOpened); |
578 | if (aShapeIter.More()) |
2bd4c032 |
579 | { |
31c0e219 |
580 | shadeFromShape (anOpened, thePrs, theDrawer, |
581 | theHasTexels, theUVOrigin, theUVRepeat, theUVScale, Standard_False); |
2bd4c032 |
582 | } |
583 | } |
31c0e219 |
584 | else |
585 | { |
5bffb882 |
586 | // if the shape type is not compound, composolid or solid, use autodetection back-facing filled |
31c0e219 |
587 | shadeFromShape (theShape, thePrs, theDrawer, |
4769a395 |
588 | theHasTexels, theUVOrigin, theUVRepeat, theUVScale, |
5bffb882 |
589 | (theVolume == StdPrs_Volume_Closed ? Standard_True : Standard_False)); |
31c0e219 |
590 | } |
2bd4c032 |
591 | |
6262338c |
592 | if (theDrawer->FaceBoundaryDraw()) |
a2d5ab2e |
593 | { |
31c0e219 |
594 | computeFaceBoundaries (theShape, thePrs, theDrawer); |
a2d5ab2e |
595 | } |
596 | } |