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
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
|
// File: TopExp.cxx
// Created: Tue Jan 19 20:20:00 1993
// Author: Remi LEQUETTE
// <rle@phylox>
#define No_Standard_NoMoreObject
#define No_Standard_NoSuchObject
#define No_Standard_TypeMismatch
#include <TopExp.ixx>
#include <TopoDS.hxx>
#include <TopExp_Explorer.hxx>
#include <TopoDS_Iterator.hxx>
#include <TopTools_ListOfShape.hxx>
#include <TopTools_MapOfShape.hxx>
#include <TopTools_MapIteratorOfMapOfShape.hxx>
//=======================================================================
//function : MapShapes
//purpose :
//=======================================================================
void TopExp::MapShapes(const TopoDS_Shape& S,
const TopAbs_ShapeEnum T,
TopTools_IndexedMapOfShape& M)
{
TopExp_Explorer Ex(S,T);
while (Ex.More()) {
M.Add(Ex.Current());
Ex.Next();
}
}
//=======================================================================
//function : MapShapes
//purpose :
//=======================================================================
void TopExp::MapShapes(const TopoDS_Shape& S,
TopTools_IndexedMapOfShape& M)
{
M.Add(S);
TopoDS_Iterator It(S);
while (It.More()) {
MapShapes(It.Value(),M);
It.Next();
}
}
//=======================================================================
//function : MapShapesAndAncestors
//purpose :
//=======================================================================
void TopExp::MapShapesAndAncestors
(const TopoDS_Shape& S,
const TopAbs_ShapeEnum TS,
const TopAbs_ShapeEnum TA,
TopTools_IndexedDataMapOfShapeListOfShape& M)
{
TopTools_ListOfShape empty;
// visit ancestors
TopExp_Explorer exa(S,TA);
while (exa.More()) {
// visit shapes
const TopoDS_Shape& anc = exa.Current();
TopExp_Explorer exs(anc,TS);
while (exs.More()) {
Standard_Integer index = M.FindIndex(exs.Current());
if (index == 0) index = M.Add(exs.Current(),empty);
M(index).Append(anc);
exs.Next();
}
exa.Next();
}
// visit shapes not under ancestors
TopExp_Explorer ex(S,TS,TA);
while (ex.More()) {
Standard_Integer index = M.FindIndex(ex.Current());
if (index == 0) index = M.Add(ex.Current(),empty);
ex.Next();
}
}
//=======================================================================
//function : FirstVertex
//purpose :
//=======================================================================
TopoDS_Vertex TopExp::FirstVertex(const TopoDS_Edge& E,
const Standard_Boolean CumOri)
{
TopoDS_Iterator ite(E,CumOri);
while (ite.More()) {
if (ite.Value().Orientation() == TopAbs_FORWARD)
return TopoDS::Vertex(ite.Value());
ite.Next();
}
return TopoDS_Vertex();
}
//=======================================================================
//function : LastVertex
//purpose :
//=======================================================================
TopoDS_Vertex TopExp::LastVertex(const TopoDS_Edge& E,
const Standard_Boolean CumOri)
{
TopoDS_Iterator ite(E,CumOri);
while (ite.More()) {
if (ite.Value().Orientation() == TopAbs_REVERSED)
return TopoDS::Vertex(ite.Value());
ite.Next();
}
return TopoDS_Vertex();
}
//=======================================================================
//function : Vertices
//purpose :
//=======================================================================
void TopExp::Vertices(const TopoDS_Edge& E,
TopoDS_Vertex& Vfirst,
TopoDS_Vertex& Vlast,
const Standard_Boolean CumOri)
{
Vfirst = Vlast = TopoDS_Vertex(); // nullify
TopoDS_Iterator ite(E,CumOri);
while (ite.More()) {
if (ite.Value().Orientation() == TopAbs_FORWARD)
Vfirst = TopoDS::Vertex(ite.Value());
else if (ite.Value().Orientation() == TopAbs_REVERSED)
Vlast = TopoDS::Vertex(ite.Value());
ite.Next();
}
}
//=======================================================================
//function : Vertices
//purpose :
//=======================================================================
void TopExp::Vertices(const TopoDS_Wire& W,
TopoDS_Vertex& Vfirst,
TopoDS_Vertex& Vlast)
{
Vfirst = Vlast = TopoDS_Vertex(); // nullify
TopTools_MapOfShape vmap;
TopoDS_Iterator it(W);
TopoDS_Vertex V1,V2;
while (it.More()) {
const TopoDS_Edge& E = TopoDS::Edge(it.Value());
if (E.Orientation() == TopAbs_REVERSED)
TopExp::Vertices(E,V2,V1);
else
TopExp::Vertices(E,V1,V2);
// add or remove in the vertex map
V1.Orientation(TopAbs_FORWARD);
V2.Orientation(TopAbs_REVERSED);
if (!vmap.Add(V1)) vmap.Remove(V1);
if (!vmap.Add(V2)) vmap.Remove(V2);
it.Next();
}
if (vmap.IsEmpty()) { // closed
TopoDS_Shape aLocalShape = V2.Oriented(TopAbs_FORWARD);
Vfirst = TopoDS::Vertex(aLocalShape);
aLocalShape = V2.Oriented(TopAbs_REVERSED);
Vlast = TopoDS::Vertex(aLocalShape);
// Vfirst = TopoDS::Vertex(V2.Oriented(TopAbs_FORWARD));
// Vlast = TopoDS::Vertex(V2.Oriented(TopAbs_REVERSED));
}
else if (vmap.Extent() == 2) { //open
TopTools_MapIteratorOfMapOfShape ite(vmap);
while (ite.More() && ite.Key().Orientation() != TopAbs_FORWARD)
ite.Next();
if (ite.More()) Vfirst = TopoDS::Vertex(ite.Key());
ite.Initialize(vmap);
while (ite.More() && ite.Key().Orientation() != TopAbs_REVERSED)
ite.Next();
if (ite.More()) Vlast = TopoDS::Vertex(ite.Key());
}
}
//=======================================================================
//function : CommonVertex
//purpose :
//=======================================================================
Standard_Boolean TopExp::CommonVertex(const TopoDS_Edge& E1,
const TopoDS_Edge& E2,
TopoDS_Vertex& V)
{
TopoDS_Vertex firstVertex1, lastVertex1, firstVertex2, lastVertex2;
TopExp::Vertices(E1, firstVertex1, lastVertex1);
TopExp::Vertices(E2, firstVertex2, lastVertex2);
if (firstVertex1.IsSame(firstVertex2) ||
firstVertex1.IsSame(lastVertex2)) {
V = firstVertex1;
return Standard_True;
}
if (lastVertex1.IsSame(firstVertex2) ||
lastVertex1.IsSame(lastVertex2)) {
V = lastVertex1;
return Standard_True;
}
return Standard_False;
} // CommonVertex
|