User talk:Rocchini/data
Some data support.
Gosset 1_32 vertices ????
0.0000000 0.5000000 0.5000000 0.2886751 0.2041241 0.6123724 0.0000000 -0.5000000 0.5000000 0.2886751 0.2041241 0.6123724 0.0000000 0.5000000 -0.5000000 0.2886751 0.2041241 0.6123724 0.0000000 -0.0000000 0.5000000 -0.5773503 0.2041241 0.6123724 -0.5000000 0.0000000 0.0000000 0.5773503 -0.2041241 0.6123724 0.0000000 0.5000000 -0.0000000 0.2886751 0.8164966 0.0000000 0.0000000 -0.5000000 -0.5000000 0.2886751 0.2041241 0.6123724 0.0000000 -0.5000000 -0.0000000 0.2886751 0.8164966 0.0000000 0.0000000 -0.0000000 -0.5000000 -0.5773503 0.2041241 0.6123724 -0.5000000 -0.5000000 0.0000000 -0.2886751 -0.2041241 0.6123724 0.0000000 -0.0000000 -0.0000000 -0.5773503 0.8164966 0.0000000 0.5000000 0.0000000 0.0000000 0.5773503 -0.2041241 0.6123724 -0.5000000 0.0000000 -0.5000000 0.5773503 0.4082483 0.0000000 0.5000000 0.0000000 0.0000000 -0.0000000 0.6123724 0.6123724 0.5000000 -0.5000000 0.0000000 -0.2886751 -0.2041241 0.6123724 -0.5000000 0.5000000 0.0000000 -0.2886751 -0.2041241 0.6123724 -0.5000000 -0.5000000 -0.5000000 -0.2886751 0.4082483 0.0000000 0.5000000 0.0000000 -0.5000000 0.5773503 0.4082483 0.0000000 -0.5000000 0.0000000 0.5000000 0.5773503 0.4082483 0.0000000 -0.5000000 0.0000000 0.0000000 -0.0000000 0.6123724 0.6123724 0.5000000 0.5000000 0.0000000 -0.2886751 -0.2041241 0.6123724 0.5000000 -0.5000000 -0.5000000 -0.2886751 0.4082483 0.0000000 -0.5000000 0.5000000 -0.5000000 -0.2886751 0.4082483 0.0000000 -0.5000000 -0.5000000 0.5000000 -0.2886751 0.4082483 0.0000000 0.5000000 0.0000000 0.5000000 0.5773503 0.4082483 0.0000000 -0.0000000 -0.0000000 -0.5000000 0.0000000 -0.6123724 0.6123724 0.5000000 0.5000000 -0.5000000 -0.2886751 0.4082483 0.0000000 0.5000000 -0.5000000 0.5000000 -0.2886751 0.4082483 0.0000000 -0.5000000 0.5000000 0.5000000 -0.2886751 0.4082483 0.0000000 -0.0000000 -0.5000000 -0.0000000 0.8660254 0.0000000 0.0000000 -0.0000000 -0.0000000 0.5000000 0.0000000 -0.6123724 0.6123724 -0.0000000 -0.0000000 -1.0000000 0.0000000 0.0000000 0.0000000 0.5000000 0.5000000 0.5000000 -0.2886751 0.4082483 0.0000000 -0.0000000 -1.0000000 -0.0000000 0.0000000 0.0000000 0.0000000 -1.0000000 -0.0000000 -0.0000000 0.0000000 0.0000000 0.0000000 -0.0000000 0.5000000 -0.0000000 0.8660254 0.0000000 0.0000000 -0.0000000 -0.0000000 -0.5000000 0.0000000 0.6123724 -0.6123724 -0.0000000 -0.0000000 1.0000000 0.0000000 0.0000000 0.0000000 -0.5000000 -0.5000000 -0.5000000 0.2886751 -0.4082483 0.0000000 -0.0000000 1.0000000 -0.0000000 0.0000000 0.0000000 0.0000000 1.0000000 -0.0000000 -0.0000000 0.0000000 0.0000000 0.0000000 -0.0000000 -0.5000000 -0.0000000 -0.8660254 0.0000000 0.0000000 -0.0000000 -0.0000000 0.5000000 0.0000000 0.6123724 -0.6123724 -0.5000000 -0.5000000 0.5000000 0.2886751 -0.4082483 0.0000000 0.5000000 -0.5000000 -0.5000000 0.2886751 -0.4082483 0.0000000 -0.5000000 0.5000000 -0.5000000 0.2886751 -0.4082483 0.0000000 -0.0000000 0.5000000 -0.0000000 -0.8660254 0.0000000 0.0000000 -0.5000000 -0.5000000 -0.0000000 0.2886751 0.2041241 -0.6123724 0.5000000 -0.5000000 0.5000000 0.2886751 -0.4082483 0.0000000 -0.5000000 0.5000000 0.5000000 0.2886751 -0.4082483 0.0000000 0.5000000 0.5000000 -0.5000000 0.2886751 -0.4082483 0.0000000 -0.5000000 -0.0000000 -0.5000000 -0.5773503 -0.4082483 0.0000000 0.5000000 -0.5000000 -0.0000000 0.2886751 0.2041241 -0.6123724 -0.5000000 0.5000000 -0.0000000 0.2886751 0.2041241 -0.6123724 0.5000000 0.5000000 0.5000000 0.2886751 -0.4082483 0.0000000 -0.5000000 -0.0000000 0.5000000 -0.5773503 -0.4082483 0.0000000 0.5000000 -0.0000000 -0.5000000 -0.5773503 -0.4082483 0.0000000 0.5000000 0.5000000 -0.0000000 0.2886751 0.2041241 -0.6123724 -0.5000000 -0.0000000 -0.0000000 -0.5773503 0.2041241 -0.6123724 0.5000000 -0.0000000 0.5000000 -0.5773503 -0.4082483 0.0000000 -0.0000000 -0.0000000 -0.0000000 0.5773503 -0.8164966 0.0000000 0.5000000 -0.0000000 -0.0000000 -0.5773503 0.2041241 -0.6123724 -0.0000000 -0.0000000 -0.5000000 0.5773503 -0.2041241 -0.6123724 -0.0000000 -0.5000000 -0.0000000 -0.2886751 -0.8164966 0.0000000 -0.0000000 -0.5000000 -0.5000000 -0.2886751 -0.2041241 -0.6123724 -0.0000000 -0.0000000 0.5000000 0.5773503 -0.2041241 -0.6123724 -0.0000000 0.5000000 -0.0000000 -0.2886751 -0.8164966 0.0000000 -0.0000000 0.5000000 -0.5000000 -0.2886751 -0.2041241 -0.6123724 -0.0000000 -0.5000000 0.5000000 -0.2886751 -0.2041241 -0.6123724 -0.0000000 0.5000000 0.5000000 -0.2886751 -0.2041241 -0.6123724 -0.5000000 -0.0000000 -0.0000000 0.0000000 -0.6123724 -0.6123724 0.5000000 -0.0000000 -0.0000000 0.0000000 -0.6123724 -0.6123724
Find Petrie souce code
int binom( int n, int k ) {
int i;
double r = 1;
if(k>n-k) {
for(i=k+1;i<=n;++i) r *= i;
for(i=2;i<=n-k;++i) r /= i;
} else {
for(i=n-k+1;i<=n;++i) r *= i;
for(i=2 ;i<=k;++i) r /= i;
}
return int(r);
}
void first_subset( int n, int m, int ss[] ) {
for(int i=0;i<m;++i) ss[i] = i;
}
bool next_subset( int n, int m, int ss[] ){
int i = m-1;
while(++ss[i]==n+i-m+1)
if(--i<0) return false;
for(++i;i<m;++i)
ss[i] = ss[i-1]+1;
return true;
}
// ND = number of dimensions, NV = number of vertices, v = coordinates of vertices
// ADJ = graph adjacency matrix, Q = number of vertices of petri polygon
void find_petri_projection( const int ND, const int NV, const double v[], const bool ADJ[], int Q ){
int i; const int NSA = ND;
std::vector<int> ss(NSA);
const double da = 2.0*PI/Q;
std::vector<double> RX(NSA); // Coordinates of petri polygon
std::vector<double> RY(NSA);
for(i=0;i<ND;++i) { RX[i] = cos(i*da); RY[i] = sin(i*da); }
int totsub = binom(NV,NSA);
first_subset(NV,NSA,&(ss[0]));
do {
bool good = true;
for(i=0;i<ND-1;++i)
if(!ADJ[ss[i]*NV+ss[i+1]]) { good = false; break; }
if(good)
{
const int M = 2*ND;
std::vector<double> x(M);
std::vector<double> A(M*(M+1));
for(i=0;i<NSA;++i) {
for(int j=0;j<ND;++j) {
A[(0 +i)*(M+1)+j+ 0] = v[ss[i]*ND+j];
A[(0 +i)*(M+1)+j+ND] = 0;
A[(NSA+i)*(M+1)+j+ 0] = 0;
A[(NSA+i)*(M+1)+j+ND] = v[ss[i]*ND+j];
}
A[(0 +i)*(M+1)+M] = RX[i];
A[(NSA+i)*(M+1)+M] = RY[i];
}
if(Gauss(M,&(A[0]),&(x[0]))){
for(i=0;i<M;++i) {
printf("%40.20lf",x[i]);
if(i==ND-1 || i==M-1) printf("};\n"); else printf(",\n");
}
printf("\n");
}
}
} while( next_subset(NV,NSA,&(ss[0])) );
}
Content Disclaimer
Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.
- The information displayed on this website is sourced in part or in whole from Wikipedia and has been adapted for the purpose of restating it. We strive to provide accurate and relevant information, however:
- There is no guarantee of absolute accuracy. Wikipedia is an open, collaborative project that can be edited by anyone, so information is subject to change.
- It is not intended to constitute professional advice. The content displayed is for informational and educational purposes only. For important decisions (e.g., medical, legal, or financial), please consult a professional.
- Content copyright. Wikipedia is licensed under the Creative Commons Attribution-ShareAlike License (CC BY-SA). This means that content may be reused with appropriate attribution and shared under a similar license.
- Responsible use. Any risk arising from the use of information from this website is entirely the responsibility of the user.