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
|
/**************************************************************************
* *
* Regina - A Normal Surface Theory Calculator *
* Computational Engine *
* *
* Copyright (c) 1999-2009, Ben Burton *
* For further details contact Ben Burton (bab@debian.org). *
* *
* This program is free software; you can redistribute it and/or *
* modify it under the terms of the GNU General Public License as *
* published by the Free Software Foundation; either version 2 of the *
* License, or (at your option) any later version. *
* *
* This program is distributed in the hope that it will be useful, but *
* WITHOUT ANY WARRANTY; without even the implied warranty of *
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU *
* General Public License for more details. *
* *
* You should have received a copy of the GNU General Public *
* License along with this program; if not, write to the Free *
* Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, *
* MA 02110-1301, USA. *
* *
**************************************************************************/
/* end stub */
#include "triangulation/ntriangulation.h"
namespace regina {
void NTriangulation::maximalForestInBoundary(
stdhash::hash_set<NEdge*, HashPointer>& edgeSet,
stdhash::hash_set<NVertex*, HashPointer>& vertexSet) const {
if (! calculatedSkeleton)
calculateSkeleton();
vertexSet.clear();
edgeSet.clear();
for (BoundaryComponentIterator bit = boundaryComponents.begin();
bit != boundaryComponents.end(); bit++)
stretchBoundaryForestFromVertex((*bit)->getVertex(0),
edgeSet, vertexSet);
}
void NTriangulation::stretchBoundaryForestFromVertex(NVertex* from,
stdhash::hash_set<NEdge*, HashPointer>& edgeSet,
stdhash::hash_set<NVertex*, HashPointer>& vertexSet) const {
vertexSet.insert(from);
std::vector<NVertexEmbedding>::const_iterator it =
from->getEmbeddings().begin();
NTetrahedron* tet;
NVertex* otherVertex;
NEdge* edge;
int vertex, yourVertex;
while (it != from->getEmbeddings().end()) {
const NVertexEmbedding& emb = *it;
tet = emb.getTetrahedron();
vertex = emb.getVertex();
for (yourVertex = 0; yourVertex < 4; yourVertex++) {
if (vertex == yourVertex)
continue;
edge = tet->getEdge(NEdge::edgeNumber[vertex][yourVertex]);
if (! (edge->isBoundary()))
continue;
otherVertex = tet->getVertex(yourVertex);
if (! vertexSet.count(otherVertex)) {
edgeSet.insert(edge);
stretchBoundaryForestFromVertex(otherVertex, edgeSet,
vertexSet);
}
}
it++;
}
}
void NTriangulation::maximalForestInSkeleton(
stdhash::hash_set<NEdge*, HashPointer>& edgeSet,
bool canJoinBoundaries) const {
if (! calculatedSkeleton)
calculateSkeleton();
stdhash::hash_set<NVertex*, HashPointer> vertexSet;
stdhash::hash_set<NVertex*, HashPointer> thisBranch;
if (canJoinBoundaries)
edgeSet.clear();
else
maximalForestInBoundary(edgeSet, vertexSet);
for (VertexIterator vit = vertices.begin(); vit != vertices.end(); vit++)
if (! (vertexSet.count(*vit))) {
stretchForestFromVertex(*vit, edgeSet, vertexSet, thisBranch);
thisBranch.clear();
}
}
bool NTriangulation::stretchForestFromVertex(NVertex* from,
stdhash::hash_set<NEdge*, HashPointer>& edgeSet,
stdhash::hash_set<NVertex*, HashPointer>& vertexSet,
stdhash::hash_set<NVertex*, HashPointer>& thisStretch) const {
// Moves out from the vertex until we hit a vertex that has already
// been visited; then stops.
// Returns true if we make such a link.
// PRE: Such a link has not already been made.
vertexSet.insert(from);
thisStretch.insert(from);
std::vector<NVertexEmbedding>::const_iterator it =
from->getEmbeddings().begin();
NTetrahedron* tet;
NVertex* otherVertex;
int vertex, yourVertex;
bool madeLink = false;
while (it != from->getEmbeddings().end()) {
const NVertexEmbedding& emb = *it;
tet = emb.getTetrahedron();
vertex = emb.getVertex();
for (yourVertex = 0; yourVertex < 4; yourVertex++) {
if (vertex == yourVertex)
continue;
otherVertex = tet->getVertex(yourVertex);
if (thisStretch.count(otherVertex))
continue;
madeLink = vertexSet.count(otherVertex);
edgeSet.insert(tet->getEdge(NEdge::edgeNumber[vertex][yourVertex]));
if (! madeLink)
madeLink =
stretchForestFromVertex(otherVertex, edgeSet, vertexSet,
thisStretch);
if (madeLink)
return true;
}
it++;
}
return false;
}
void NTriangulation::maximalForestInDualSkeleton(
stdhash::hash_set<NFace*, HashPointer>& faceSet) const {
if (! calculatedSkeleton)
calculateSkeleton();
faceSet.clear();
stdhash::hash_set<NTetrahedron*, HashPointer> visited;
for (TetrahedronIterator it = tetrahedra.begin(); it != tetrahedra.end();
it++)
if (! (visited.count(*it)))
stretchDualForestFromTet(*it, faceSet, visited);
}
void NTriangulation::stretchDualForestFromTet(NTetrahedron* tet,
stdhash::hash_set<NFace*, HashPointer>& faceSet,
stdhash::hash_set<NTetrahedron*, HashPointer>& visited) const {
visited.insert(tet);
NTetrahedron* adjTet;
for (int face = 0; face < 4; face++) {
adjTet = tet->adjacentTetrahedron(face);
if (adjTet)
if (! (visited.count(adjTet))) {
faceSet.insert(tet->getFace(face));
stretchDualForestFromTet(adjTet, faceSet, visited);
}
}
}
} // namespace regina
|
