Changeset 15813d in git for gfanlib/gfanlib_mixedvolume.cpp
 Timestamp:
 Aug 8, 2016, 2:16:11 PM (7 years ago)
 Branches:
 (u'jengelhdatetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', '0604212ebb110535022efecad887940825b97c3f')
 Children:
 7cc3fdae6091a6fab65626857c1ed2c59f027dcd
 Parents:
 47a774fa4174b578843d43227fcc351165473747
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

gfanlib/gfanlib_mixedvolume.cpp
r47a774 r15813d 21 21 static Integer stringToInteger(char const *s) 22 22 { 23 24 25 23 Integer ret; 24 while(*s)ret=Integer(10)*ret+((*(s++))'0'); 25 return ret; 26 26 } 27 27 … … 40 40 virtual const char* what() const throw() 41 41 { 42 42 return "Exception: The number of polytopes passed to the mixed volume computation does not match the ambient dimension."; 43 43 } 44 44 }MVAmbientDimensionMismatch; … … 47 47 static std::vector<Matrix<mvtyp> > convertTuple(std::vector<IntMatrix> const &tuple) 48 48 { 49 50 51 52 53 54 55 56 57 58 59 49 vector<Matrix<mvtyp> > ret; 50 ret.reserve(tuple.size()); 51 for(int i=0;i<tuple.size();i++) 52 { 53 Matrix<mvtyp> a(tuple[i].getHeight(),tuple[i].getWidth()); 54 for(int j=0;j<a.getHeight();j++) 55 for(int k=0;k<a.getWidth();k++) 56 a[j][k]=tuple[i][j][k]; 57 ret.push_back(a); 58 } 59 return ret; 60 60 } 61 61 62 // 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 //assert(tuple2.size());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 62 // mvtyp::Double 63 Integer mixedVolume(vector<IntMatrix> const &tuple, int nthreads, int steps) 64 { 65 //Zerodimensional volumes are obtained by taking determinants of 0x0 matrices. Such determinants are 1. Hence the volume polynomial is constant 1. The coefficient of the product of the variables is 1. 66 //Alternative explanation. A generic polynomial system with zero variables has exactly 1 solution. 67 if(tuple.size()==0){return Integer(1);} 68 69 // For now, let's make in an error to pass the wrong number of polytopes. Of course we could define the 70 // mixed volume to be 0 in that case, but the code calling will almost certainly be wrong. It is safer to throw. 71 // for(const auto &x:tuple) // Range based for is not supported until gcc 4.6/ 72 for(auto x=tuple.begin();x!=tuple.end();x++) 73 if(x>getHeight()!=tuple.size()) 74 {throw MVAmbientDimensionMismatch;} 75 76 std::vector<Matrix<mvtyp> > tuple2=convertTuple(tuple); 77 // assert(tuple2.size()); 78 typedef SpecializedRTraverser<mvtyp,mvtyp::Double,mvtyp::Divisor> MySpecializedRTraverser; 79 vector<MySpecializedRTraverser> T1; 80 int N=nthreads; 81 if(N==0)N=1;// Even if we do not parallelize, we still need one traverser. 82 T1.reserve(N); 83 vector<Traverser*> I; 84 for(int i=0;i<N;i++)T1.emplace_back(tuple2); 85 for(int i=0;i<N;i++)I.push_back(&(T1[i])); 86 87 // debug<<"Initialized.\n"; 88 89 if(nthreads) 90 traverse_threaded(&(I[0]),N,steps); 91 else 92 traverse_simple(I[0]); 93 94 bool aborted=false; 95 for(int i=0;i<N;i++)aborted=I[i]>aborting; 96 97 if(aborted) 98 { 99 throw MVExceptionRethrow; 100 } 101 102 mvtyp::Double total; 103 int totalSteps=0; 104 for(int i=0;i<N;i++) 105 { 106 // debug<<"#"<<((MySpecializedRTraverser*)(I[i]))>mixedVolume.toString()<<"Steps:"<<((MySpecializedRTraverser*)(I[i]))>numberOfExpensiveSteps<<"\n"; 107 //debug<<((SpecializedMTraverser*)(I[i]))>T.counter; 108 total.addWithOverflowCheck(((MySpecializedRTraverser*)(I[i]))>mixedVolume); 109 totalSteps+=((MySpecializedRTraverser*)(I[i]))>numberOfExpensiveSteps; 110 } 111 // debug<<"Total:"<<(int)total.v<<"\n"; 112 // debug<<"Totalsteps:"<<totalSteps<<"\n"; 113 114 115 return stringToInteger(total.toString().c_str()); 116 } 117 118 119 namespace MixedVolumeExamples{ 120 vector<IntMatrix> cyclic(int n) 121 { 122 vector<IntMatrix> ret; 123 for(int i=1;i<n;i++) 124 { 125 IntMatrix m(n,n); 126 for(int y=0;y<n;y++) 127 for(int x=0;x<n;x++) 128 m[y][x]=((xy+n)%n)<i; 129 ret.push_back(m); 130 } 131 132 IntMatrix last(n,2); 133 for(int y=0;y<n;y++)last[y][0]=1; 134 ret.push_back(last); 135 136 return ret; 137 } 138 vector<IntMatrix> noon(int n) 139 { 140 vector<IntMatrix> ret; 141 for(int i=0;i<n;i++) 142 { 143 IntMatrix m(n,n+1); 144 for(int y=0;y<n1;y++) 145 m[y+(i<=y)][y]=2; 146 for(int x=0;x<n;x++) 147 m[i][x]=1; 148 ret.push_back(m); 149 } 150 return ret; 151 } 152 vector<IntMatrix> chandra(int n) 153 { 154 vector<IntMatrix> ret; 155 for(int i=0;i<n;i++) 156 { 157 IntMatrix m(n,n+1); 158 for(int y=0;y<n1;y++) 159 m[y][y+1]=1; 160 for(int x=0;x<n;x++) 161 m[i][x]+=1; 162 ret.push_back(m); 163 } 164 return ret; 165 } 166 vector<IntMatrix> katsura(int n) 167 { 168 n++; 169 vector<IntMatrix> ret; 170 for(int i=0;i<n1;i++) 171 { 172 IntMatrix m(n,n+1((i+1)/2)); 173 for(int y=0;y<n((i+1)/2);y++) 174 { 175 m[n1y][y]=1; 176 m[(n1yi)>0 ? (n1yi) : (n1yi)][y]+=1; 177 } 178 m[i][m.getWidth()1]=1; 179 ret.push_back(m); 180 } 181 ret.push_back(combineLeftRight(IntMatrix::identity(n),IntMatrix(n,1))); 182 return ret; 183 } 184 vector<IntMatrix> gaukwa(int n) 185 { 186 vector<IntMatrix> ret; 187 for(int i=0;i<2*n;i++) 188 ret.push_back(combineLeftRight(combineOnTop(IntMatrix::identity(n),i*IntMatrix::identity(n)),IntMatrix(2*n,1))); 189 return ret; 190 } 191 vector<IntMatrix> eco(int n) 192 { 193 vector<IntMatrix> ret; 194 for(int i=0;i<n1;i++) 195 { 196 IntMatrix m(n,ni); 197 for(int y=0;y<n(i+1);y++) 198 { 199 m[y+i][y]=1; 200 m[n1][y]=1; 201 if(y)m[y1][y]=1; 202 } 203 ret.push_back(m); 204 } 205 ret.push_back(combineLeftRight(combineOnTop(IntMatrix::identity(n1),IntMatrix(1,n1)),IntMatrix(n,1))); 206 return ret; 207 } 208 } 209 209 210 210 }
Note: See TracChangeset
for help on using the changeset viewer.