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
|
/**************************************************************************
* *
* Regina - A Normal Surface Theory Calculator *
* Computational Engine *
* *
* Copyright (c) 1999-2008, 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 "subcomplex/nsatblockstarter.h"
#include "subcomplex/nsatblocktypes.h"
namespace regina {
const NSatBlockStarterSet NSatBlockStarterSet::blocks;
void NSatBlockStarterSet::initialise() {
NSatBlockStarter* starter;
starter = new NSatBlockStarter;
starter->block_ = NSatTriPrism::insertBlock(starter->triangulation_, true);
insert(starter);
starter = new NSatBlockStarter;
starter->block_ = NSatCube::insertBlock(starter->triangulation_);
insert(starter);
// Try various reflector strips of small length.
starter = new NSatBlockStarter;
starter->block_ = NSatReflectorStrip::insertBlock(starter->triangulation_,
1, false);
insert(starter);
starter = new NSatBlockStarter;
starter->block_ = NSatReflectorStrip::insertBlock(starter->triangulation_,
1, true);
insert(starter);
starter = new NSatBlockStarter;
starter->block_ = NSatReflectorStrip::insertBlock(starter->triangulation_,
2, false);
insert(starter);
starter = new NSatBlockStarter;
starter->block_ = NSatReflectorStrip::insertBlock(starter->triangulation_,
2, true);
insert(starter);
starter = new NSatBlockStarter;
starter->block_ = NSatReflectorStrip::insertBlock(starter->triangulation_,
3, false);
insert(starter);
starter = new NSatBlockStarter;
starter->block_ = NSatReflectorStrip::insertBlock(starter->triangulation_,
3, true);
insert(starter);
starter = new NSatBlockStarter;
starter->block_ = NSatReflectorStrip::insertBlock(starter->triangulation_,
4, false);
insert(starter);
starter = new NSatBlockStarter;
starter->block_ = NSatReflectorStrip::insertBlock(starter->triangulation_,
4, true);
insert(starter);
}
void NSatBlockStarterSearcher::findStarterBlocks(NTriangulation* tri) {
// Clean up usedTets if required.
if (! usedTets.empty())
usedTets.clear();
// Hunt for a starting block.
unsigned long i;
NSatBlockStarterSet::iterator it;
std::list<NIsomorphism*> isos;
std::list<NIsomorphism*>::iterator isoIt;
NSatBlock* starter;
for (it = NSatBlockStarterSet::begin(); it != NSatBlockStarterSet::end();
it++) {
// Look for this particular starting block.
// Get trivialities out of the way first.
if (tri->isOrientable() && ! (*it)->triangulation().isOrientable())
continue;
if (tri->getNumberOfTetrahedra() <
(*it)->triangulation().getNumberOfTetrahedra())
continue;
// Find all isomorphisms of the starter block within the given
// triangulation.
if (! (*it)->triangulation().findAllSubcomplexesIn(*tri, isos))
continue;
// Run through each isomorphism in the list and see if it leads
// somewhere useful.
//
// All of the isomorphisms in this list _must_ be destroyed at
// some point before we loop back to the next starter block.
for (isoIt = isos.begin(); isoIt != isos.end(); isoIt++) {
starter = (*it)->block()->clone();
starter->transform(&(*it)->triangulation(), *isoIt, tri);
// Create an initial blacklist of tetrahedra consisting of
// those in the isomorphic image of the initial starting block.
for (i = 0; i < (*it)->triangulation().getNumberOfTetrahedra(); i++)
usedTets.insert(tri->getTetrahedron((*isoIt)->tetImage(i)));
// And process!
// Note that useStarterBlock() passes ownership of the starter
// block elsewhere.
if (! useStarterBlock(starter)) {
// The search ends now.
// Don't forget to destroy the remaining isomorphisms
// that we never looked at.
usedTets.clear();
for (isoIt++; isoIt != isos.end(); isoIt++)
delete *isoIt;
return;
}
// Keep on searching.
// Destroy this isomorphism and make things ready for the next one.
usedTets.clear();
delete *isoIt;
}
// Make sure the list is empty again for the next time around.
isos.clear();
}
// Search over. Nothing here to see.
}
} // namespace regina
|
