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
|
/**************************************************************************
* *
* Regina - A Normal Surface Theory Calculator *
* Computational Engine *
* *
* Copyright (c) 1999-2011, 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 */
/*! \file enumerate/nhilbertcd.h
* \brief Provides a modified Contejean-Devie algorithm for Hilbert basis
* enumeration.
*/
#ifndef __NHILBERTCD_H
#ifndef __DOXYGEN
#define __NHILBERTCD_H
#endif
#include "regina-core.h"
#include <iterator>
#include <list>
#include <vector>
namespace regina {
class NEnumConstraintList;
class NMatrixInt;
class NProgressMessage;
class NRay;
/**
* \weakgroup enumerate
* @{
*/
/**
* Implements a modified Contejean-Devie algorithm for enumerating Hilbert
* bases. This is based on the stack-based algorithm described in
* "An efficient incremental algorithm for solving systems of linear
* Diophantine equations", Inform. and Comput. 113 (1994), 143-172,
* and has been modified to allow for additional constraints (such as
* the quadrilateral constraints from normal surface theory).
*
* All routines of interest within this class are static; no object of
* this class should ever be created.
*
* \warning For normal surface theory, the Contejean-Devie algorithm is
* extremely slow, even when modified to incorporate admissibility
* constraints. Consider using the much faster NHilbertPrimal or
* NHilbertDual instead.
*
* \ifacespython Not present.
*/
class NHilbertCD {
public:
/**
* Determines the Hilbert basis that generates all integer
* points in the intersection of the <i>n</i>-dimensional
* non-negative orthant with some linear subspace.
* The resulting basis elements will be of the class \a RayClass,
* will be newly allocated, and will be written to the given output
* iterator. Their deallocation is the responsibility of whoever
* called this routine.
*
* The non-negative orthant is an <i>n</i>-dimensional cone with
* its vertex at the origin. The extremal rays of this cone are
* the \a n non-negative coordinate axes. This cone also has \a n
* facets, where the <i>i</i>th facet is the non-negative
* orthant of the plane perpendicular to the <i>i</i>th coordinate
* axis.
*
* This routine takes a linear subspace, defined by the
* intersection of a set of hyperplanes through the origin (this
* subspace is described as a matrix, with each row giving the
* equation for one hyperplane).
*
* The purpose of this routine is to compute the Hilbert basis of
* the set of all integer points in the intersection of the
* original cone with this linear subspace. The resulting list
* of basis vectors will contain no duplicates or redundancies.
*
* The parameter \a constraints may contain a set of validity
* constraints, in which case this routine will only return \e valid
* basis elements. Each validity constraint is of the form "at
* most one of these coordinates may be non-zero"; see the
* NEnumConstraintList class for details. These contraints have the
* important property that, although validity is not preserved under
* addition, \e invalidity is.
*
* A text-based progress watcher may be passed for progress reporting.
* If so, this routine will poll for cancellation requests accordingly.
*
* \pre The template argument RayClass is derived from NRay (or
* may possibly be NRay itself).
*
* \warning For normal surface theory, the Contejean-Devie algorithm is
* extremely slow, even when modified to incorporate admissibility
* constraints. Consider using the much faster NHilbertPrimal or
* NHilbertDual instead.
*
* @param results the output iterator to which the resulting basis
* elements will be written; this must accept objects of type
* <tt>RayClass*</tt>.
* @param subspace a matrix defining the linear subspace to intersect
* with the given cone. Each row of this matrix is the equation
* for one of the hyperplanes whose intersection forms this linear
* subspace. The number of columns in this matrix must be the
* dimension of the overall space in which we are working.
* @param constraints a set of validity constraints as described
* above, or 0 if no additional constraints should be imposed.
* @param progress a text-based progress watcher through which progress
* will be reported, or 0 if no progress reporting is required.
* Note that NProgress::setFinished() will \e not be called, since
* whoever called this routine may need to do further processing.
*/
template <class RayClass, class OutputIterator>
static void enumerateHilbertBasis(OutputIterator results,
const NMatrixInt& subspace, const NEnumConstraintList* constraints,
NProgressMessage* progress = 0);
private:
/**
* A helper class for Hilbert basis enumeration, describing a
* single candidate basis vector.
*
* The coordinates of the vector are inherited through the
* superclass NRay.
*
* The \a BitmaskType template argument is used to store one bit
* per coordinate, which is \c false if the coordinate is zero
* or \c true if the coordinate is non-zero.
*
* \pre The template argument \a BitmaskType is one of Regina's
* bitmask types, such as NBitmask, NBitmask1 or NBitmask2.
*/
template <class BitmaskType>
struct VecSpec : public NRay {
BitmaskType mask_;
/**< A bitmask indicating which coordinates are zero
(\c false) and which are non-zero (\c true). */
/**
* Creates the zero vector.
*
* @param dim the total dimension of the space (and
* therefore the toatl length of this vector).
*/
inline VecSpec(unsigned dim);
};
/**
* Identical to the public routine enumerateHilbertBasis(),
* except that there is an extra template parameter \a BitmaskType.
* This describes what type should be used for bitmasks that
* assign flags to individual coordinate positions.
*
* All arguments to this function are identical to those for the
* public routine enumerateHilbertBasis().
*
* \pre The bitmask type is one of Regina's bitmask types, such
* as NBitmask, NBitmask1 or NBitmask2.
* \pre The type \a BitmaskType can handle at least \a n bits,
* where \a n is the dimension of the Euclidean space (i.e., the
* number of columns in \a subspace).
*/
template <class RayClass, class BitmaskType, class OutputIterator>
static void enumerateUsingBitmask(OutputIterator results,
const NMatrixInt& subspace, const NEnumConstraintList* constraints,
NProgressMessage* progress);
/**
* Private constructor to ensure that objects of this class are
* never created.
*/
NHilbertCD();
};
/*@}*/
// Inline functions for NHilbertCD
inline NHilbertCD::NHilbertCD() {
}
// Inline functions for NHilbertCD::VecSpec
template <class BitmaskType>
inline NHilbertCD::VecSpec<BitmaskType>::VecSpec(unsigned dim) :
NRay(dim), mask_(dim) {
// All vector elements are initialised to zero thanks to the
// NLargeInteger default constructor.
}
} // namespace regina
// Template definitions
#include "enumerate/nhilbertcd.tcc"
#endif
|
