1 // Created on: 1995-03-06
2 // Created by: Laurent PAINNOT
3 // Copyright (c) 1995-1999 Matra Datavision
4 // Copyright (c) 1999-2014 OPEN CASCADE SAS
6 // This file is part of Open CASCADE Technology software library.
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
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.
14 // Alternatively, this file may be used under the terms of Open CASCADE
15 // commercial license or contractual agreement.
17 #include <DrawTrSurf_Triangulation.ixx>
18 #include <Poly_Connect.hxx>
19 #include <Poly_Triangle.hxx>
20 #include <Poly_Array1OfTriangle.hxx>
21 #include <TColStd_Array1OfInteger.hxx>
23 #include <Draw_Color.hxx>
30 //=======================================================================
31 //function : DrawTrSurf_Triangulation
33 //=======================================================================
35 DrawTrSurf_Triangulation::DrawTrSurf_Triangulation
36 (const Handle(Poly_Triangulation)& T):
38 myNodes(Standard_False),
39 myTriangles(Standard_False)
41 // Build the connect tool
44 Standard_Integer i,j,nFree, nInternal, nbTriangles = T->NbTriangles();
45 Standard_Integer t[3];
47 // count the free edges
49 for (i = 1; i <= nbTriangles; i++) {
50 pc.Triangles(i,t[0],t[1],t[2]);
51 for (j = 0; j < 3; j++)
52 if (t[j] == 0) nFree++;
55 // allocate the arrays
56 myFree = new TColStd_HArray1OfInteger(1,2*nFree);
57 nInternal = (3*nbTriangles - nFree) / 2;
58 myInternals = new TColStd_HArray1OfInteger(1,2*nInternal);
60 TColStd_Array1OfInteger& Free = myFree->ChangeArray1();
61 TColStd_Array1OfInteger& Internal = myInternals->ChangeArray1();
63 Standard_Integer fr = 1, in = 1;
64 const Poly_Array1OfTriangle& triangles = T->Triangles();
65 Standard_Integer n[3];
66 for (i = 1; i <= nbTriangles; i++) {
67 pc.Triangles(i,t[0],t[1],t[2]);
68 triangles(i).Get(n[0],n[1],n[2]);
69 for (j = 0; j < 3; j++) {
70 Standard_Integer k = (j+1) % 3;
76 // internal edge if this triangle has a lower index than the adjacent
79 Internal(in+1) = n[k];
86 //=======================================================================
87 //function : Triangulation
89 //=======================================================================
91 Handle(Poly_Triangulation) DrawTrSurf_Triangulation::Triangulation() const
93 return myTriangulation;
96 //=======================================================================
97 //function : ShowNodes
99 //=======================================================================
101 void DrawTrSurf_Triangulation::ShowNodes(const Standard_Boolean B)
106 //=======================================================================
107 //function : ShowNodes
109 //=======================================================================
111 Standard_Boolean DrawTrSurf_Triangulation::ShowNodes() const
116 //=======================================================================
117 //function : ShowTriangles
119 //=======================================================================
121 void DrawTrSurf_Triangulation::ShowTriangles(const Standard_Boolean B)
126 //=======================================================================
127 //function : ShowTriangles
129 //=======================================================================
131 Standard_Boolean DrawTrSurf_Triangulation::ShowTriangles() const
136 //=======================================================================
139 //=======================================================================
141 void DrawTrSurf_Triangulation::DrawOn(Draw_Display& dis) const
144 Standard_Integer i,n;
146 const TColgp_Array1OfPnt& Nodes = myTriangulation->Nodes();
150 dis.SetColor(Draw_rouge);
151 const TColStd_Array1OfInteger& Free = myFree->Array1();
152 n = Free.Length() / 2;
153 for (i = 1; i <= n; i++) {
154 dis.Draw(Nodes(Free(2*i-1)),Nodes(Free(2*i)));
159 dis.SetColor(Draw_bleu);
160 const TColStd_Array1OfInteger& Internal = myInternals->Array1();
161 n = Internal.Length() / 2;
162 for (i = 1; i <= n; i++) {
163 dis.Draw(Nodes(Internal(2*i-1)),Nodes(Internal(2*i)));
169 dis.SetColor(Draw_jaune);
170 n = myTriangulation->NbNodes();
171 for (i = 1; i <= n; i++) {
172 Sprintf(text,"%d",i);
173 dis.DrawString(Nodes(i),text);
178 dis.SetColor(Draw_vert);
179 n = myTriangulation->NbTriangles();
180 Standard_Integer t[3],j;
181 const Poly_Array1OfTriangle& triangle = myTriangulation->Triangles();
182 for (i = 1; i <= n; i++) {
183 triangle(i).Get(t[0],t[1],t[2]);
185 gp_XYZ& bary = P.ChangeCoord();
186 for (j = 0; j < 3; j++)
187 bary.Add(Nodes(t[j]).Coord());
188 bary.Multiply(1./3.);
190 Sprintf(text,"%d",i);
191 dis.DrawString(P,text);
196 //=======================================================================
199 //=======================================================================
201 Handle(Draw_Drawable3D) DrawTrSurf_Triangulation::Copy() const
203 return new DrawTrSurf_Triangulation(myTriangulation);
206 //=======================================================================
209 //=======================================================================
211 void DrawTrSurf_Triangulation::Dump(Standard_OStream& S) const
213 Poly::Dump(myTriangulation,S);
216 //=======================================================================
219 //=======================================================================
221 void DrawTrSurf_Triangulation::Whatis(Draw_Interpretor& I) const
223 I << "triangulation";