1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
|
// File: TopOpeBRepBuild_Tools2d.cxx
// Created: Mon Nov 29 12:36:31 1999
// Author: Peter KURNEV
// <pkv@irinox.nnov.matra-dtv.fr>
#include <TopOpeBRepBuild_Tools2d.ixx>
#include <TopoDS_Wire.hxx>
#include <TopExp_Explorer.hxx>
#include <TopOpeBRepBuild_VertexInfo.hxx>
#include <TopoDS.hxx>
#include <TopoDS_Vertex.hxx>
#include <TopExp.hxx>
#include <TopTools_IndexedMapOfShape.hxx>
#include <TopTools_ListOfShape.hxx>
#include <TopTools_ListIteratorOfListOfShape.hxx>
#include <stdio.h>
static
void BuildPath (const TopoDS_Vertex& myVertex0,
const TopoDS_Edge& myEdge,
const TopoDS_Vertex& myVertex,
const Standard_Integer aNbEdges,
TopOpeBRepBuild_IndexedDataMapOfShapeVertexInfo& M,
Standard_Integer anEdgesCount,
Standard_Integer& aBreakFlag,
TopTools_ListOfShape& myResList);
//=======================================================================
// function :TopOpeBRepBuild_Tools2d::Path
// purpose:
//=======================================================================
void TopOpeBRepBuild_Tools2d::Path(const TopoDS_Wire& aWire, TopTools_ListOfShape& aResList)
{
Standard_Integer anEdgesCount=0, aNbEdges=0, aBreakFlag=0;
TopTools_ListOfShape myResList;
TopoDS_Vertex myVertex, myVertex0;
TopoDS_Edge myEdge, aNullEdge;
TopExp_Explorer ex(aWire,TopAbs_EDGE);
for (; ex.More(); ex.Next()) aNbEdges++;
myResList.Clear();
TopOpeBRepBuild_IndexedDataMapOfShapeVertexInfo M;
TopOpeBRepBuild_Tools2d::MakeMapOfShapeVertexInfo(aWire, M);
myEdge=aNullEdge;
myVertex0=TopoDS::Vertex(M.FindKey(1));
myVertex=myVertex0;
BuildPath (myVertex0, myEdge, myVertex, aNbEdges, M, anEdgesCount, aBreakFlag, myResList);
//
aResList.Clear();
aResList=myResList;
}
//=======================================================================
// function :BuildPath
// purpose:
//=======================================================================
void BuildPath (const TopoDS_Vertex& myVertex0,
const TopoDS_Edge& myInputEdge,
const TopoDS_Vertex& myInputVertex,
const Standard_Integer aNbEdges,
TopOpeBRepBuild_IndexedDataMapOfShapeVertexInfo& M,
Standard_Integer anEdgesCount,
Standard_Integer& aBreakFlag,
TopTools_ListOfShape& myResList)
{
Standard_Integer j = 1, aFoundOut, aNbCases, stopFlag=0;
TopoDS_Edge myEdge;
TopoDS_Vertex myVertex;
if (aBreakFlag==1) return;
TopOpeBRepBuild_VertexInfo& aVInfo=M.ChangeFromKey(myInputVertex);
//
aVInfo.SetCurrentIn (myInputEdge);
aVInfo.Prepare(myResList);
aNbCases=aVInfo.NbCases();
if (!aNbCases) aBreakFlag=2;
for (j=1; j<=aNbCases; j++) {
myEdge=aVInfo.CurrentOut();
aFoundOut=aVInfo.FoundOut();
if (!aFoundOut) { //FondOut=0 TUPICK
aBreakFlag=2;
return;
}
else {
if (stopFlag) { // if previous path was wrong
aVInfo.RemovePassed();
myResList.RemoveFirst();
stopFlag=0;
anEdgesCount--;
}
aVInfo.AppendPassed (myEdge);
myResList.Prepend (myEdge);
anEdgesCount++;
myVertex=(myEdge.Orientation()==TopAbs_FORWARD)?
TopExp::LastVertex(myEdge) : TopExp::FirstVertex(myEdge);
if (myVertex.IsSame(myVertex0) && anEdgesCount==aNbEdges) {
aBreakFlag=1;
return;
}
BuildPath (myVertex0, myEdge, myVertex, aNbEdges, M, anEdgesCount, aBreakFlag, myResList);
////
if (aBreakFlag==1) {
return;
}
if (aBreakFlag==2) {// Come back
if (j==aNbCases) {
aVInfo.RemovePassed();
myResList.RemoveFirst();
anEdgesCount--;
////
return;
}
else {
stopFlag=1;
aBreakFlag=0; // Next j if possible
}
} // end of if (aBreakFlag==2)
} // end of else .i.e. aFoundOut#0
} // end of for (j=1; j<=aNbCases; j++)
}
//=======================================================================
// function :TopOpeBRepBuild_Tools2d::MakeMapOfShapeVertexInfo
// purpose:
//=======================================================================
void TopOpeBRepBuild_Tools2d::MakeMapOfShapeVertexInfo(const TopoDS_Wire& aWire,
TopOpeBRepBuild_IndexedDataMapOfShapeVertexInfo& M)
{
TopOpeBRepBuild_VertexInfo empty;
TopExp_Explorer exa(aWire,TopAbs_EDGE);
for (; exa.More(); exa.Next()) {
const TopoDS_Edge& anEdge = TopoDS::Edge(exa.Current());
TopExp_Explorer exs(anEdge, TopAbs_VERTEX);
for (; exs.More(); exs.Next()) {
const TopoDS_Vertex& aVertex= TopoDS::Vertex(exs.Current());
Standard_Integer index = M.FindIndex(aVertex);
if (!index)
index = M.Add(aVertex, empty);
TopOpeBRepBuild_VertexInfo& aVInfo= M(index);
aVInfo.SetVertex (aVertex);
TopAbs_Orientation anOr=aVertex.Orientation();
if (anOr==TopAbs_FORWARD ) aVInfo.AddOut (anEdge);
else if (anOr==TopAbs_REVERSED) aVInfo.AddIn (anEdge);
}
}
Standard_Integer i, aNb;
aNb=M.Extent();
for (i=1; i<=aNb; i++) {
TopOpeBRepBuild_VertexInfo& aVInfo=M(i);
const TopTools_IndexedMapOfOrientedShape& EdgesIn =aVInfo.EdgesIn();
const TopTools_IndexedMapOfOrientedShape& EdgesOut =aVInfo.EdgesOut();
Standard_Integer aNbEdgesIn, aNbEdgesOut;
aNbEdgesIn =EdgesIn.Extent();
aNbEdgesOut =EdgesOut.Extent();
if (aNbEdgesIn!=1 && aNbEdgesOut!=1) {
aVInfo.SetSmart (Standard_True);
}
}
}
//=======================================================================
// function :TopOpeBRepBuild_Tools2d::DumpMapOfShapeVertexInfo
// purpose:
//=======================================================================
void TopOpeBRepBuild_Tools2d::DumpMapOfShapeVertexInfo(const TopOpeBRepBuild_IndexedDataMapOfShapeVertexInfo& M)
{
Standard_Integer i, aNb;
aNb=M.Extent();
for (i=1; i<=aNb; i++) {
const TopOpeBRepBuild_VertexInfo& aVInfo=M(i);
printf(" Vert.#%d, ", i);
const TopTools_ListOfShape& aList=aVInfo.ListPassed();
if (aList.Extent()) {
TopTools_ListIteratorOfListOfShape anIt(aList);
for (; anIt.More(); anIt.Next()) {
printf("pass,");
}
}
else {
printf("none");
}
printf("\n");
}
}
|
