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
|
/**************************************************************************
* *
* Regina - A Normal Surface Theory Calculator *
* Form a census of splitting surface signatures of given order *
* *
* Copyright (c) 2013-2025, 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. *
* *
* As an exception, when this program is distributed through (i) the *
* App Store by Apple Inc.; (ii) the Mac App Store by Apple Inc.; or *
* (iii) Google Play by Google Inc., then that store may impose any *
* digital rights management, device limits and/or redistribution *
* restrictions that are required by its terms of service. *
* *
* 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, see <https://www.gnu.org/licenses/>. *
* *
**************************************************************************/
#include <enumerate/treetraversal.h>
#include <surface/normalsurfaces.h>
#include <triangulation/dim3.h>
using namespace regina;
/**
* Output information on how to use this program, and then terminate the
* entire program with return value 1.
*
* \param program the name of this program (typically argv[0]).
*/
void usage(const char* program) {
std::cerr << "Usage:\n\n"
<< program << " ( -s | -q | -a | -o | -e | -3 ) [--] <isosig> ...\n\n"
" -s : Use standard coordinates (7n dimensions)\n"
" -q : Use quadrilateral coordinates (3n dimensions)\n"
" -a : Use standard almost normal coordinates (10n dimensions)\n"
" -o : Use quadrilateral-octagon coordinates (6n dimensions)\n"
" -e : Only detect 0-efficiency (not full vertex enumeration)\n"
" -3 : Detect an almost normal sphere (not full vertex enumeration)\n"
"\n";
::exit(1);
}
/**
* The main body of the program.
*
* For each isomorphism signature passed on the command line, we build
* the corresponding triangulation and then run away to perform the tree
* traversal algorithm.
*/
int main(int argc, char* argv[]) {
char mode = 0;
if (argc == 1)
usage(argv[0]);
bool found = false;
bool noMoreSwitches = false;
for (int i = 1; i < argc; ++i) {
// Handle command-line arguments:
if (argv[i][0] == '-' && ! noMoreSwitches) {
if (found)
usage(argv[0]);
switch (argv[i][1]) {
case '-':
noMoreSwitches = true;
break;
case 'q':
case 's':
case 'a':
case 'o':
case 'e':
case '3':
if (mode && mode != argv[i][1])
usage(argv[0]);
mode = argv[i][1];
break;
default:
usage(argv[0]);
}
continue;
}
if (! mode)
usage(argv[0]);
// Process the next triangulation on the command line:
Triangulation<3> t;
try {
t = Triangulation<3>::fromIsoSig(argv[i]);
} catch (const regina::InvalidArgument&) {
std::cerr << "ERROR: Could not reconstruct " << argv[i]
<< std::endl;
continue;
}
found = true;
if (t.isOrientable())
t.orient();
std::cout << "PROCESSING: " << argv[i] << std::endl;
if (mode == 's' || mode == 'q' || mode == 'a' || mode == 'o') {
NormalCoords coords = (mode == 's' ? NormalCoords::Standard :
mode == 'q' ? NormalCoords::Quad :
mode == 'a' ? NormalCoords::AlmostNormal :
NormalCoords::QuadOct);
try {
TreeEnumeration<> search(t, coords);
search.run([](const auto& /* tree */) {
/*
std::cout << "SOLN #" << tree.solutions() << ": ";
tree.dumpTypes(std::cout);
std::cout << std::endl;
*/
return false;
});
std::cout << "# solutions = " << search.solutions()
<< std::endl;
std::cout << "# nodes visited = " << search.visited()
<< std::endl;
} catch (const ReginaException&) {
std::cerr << "ERROR: Constraints broken." << std::endl;
}
} else {
try {
TreeSingleSoln<LPConstraintEulerPositive>
search(t, mode == '3' ? NormalCoords::AlmostNormal :
NormalCoords::Standard);
if (search.find()) {
std::cout << "Found non-trivial Euler > 0:"
<< std::endl;
search.dumpTypes(std::cout);
std::cout << std::endl;
std::cout << "# nodes visited = " << search.visited()
<< std::endl;
} else {
std::cout << "No non-trivial solution with Euler > 0"
<< std::endl;
std::cout << "# nodes visited = " << search.visited()
<< std::endl;
}
} catch (const ReginaException&) {
std::cerr << "ERROR: Constraints broken." << std::endl;
}
}
}
if (! found)
usage(argv[0]);
return 0;
}
|
