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
|
#include "parser.h"
#include "printer.h"
#include "polynomial.h"
#include "division.h"
#include "lp.h"
#include "gfanapplication.h"
#include "polyhedralcone.h"
#include "polymakefile.h"
#include "determinant.h"
#include "subspace.h"
#include "triangulation.h"
class TriangulateApplication : public GFanApplication
{
FieldOption theFieldOption;
StringOption inputOption;
StringOption outputOption;
public:
bool includeInDefaultInstallation()
{
return false;
}
const char *helpText()
{
return "This program ........\n";
}
TriangulateApplication():
inputOption("-i","Specify the name of the input file.","polymake.out"),
outputOption("-o","Specify the name of the output file.","polymake.out2")
{
registerOptions();
}
const char *name()
{
return "_triangulate";
}
void printIntList(list<int> const &v)
{
FILE *f=Stderr;
fprintf(f,"{");
for(list<int>::const_iterator i=v.begin();i!=v.end();i++)
{
if(i!=v.begin())fprintf(f," ");
fprintf(f,"%i",*i);
}
fprintf(f,"}\n");
}
void printIntListList(list<list<int> > const &l)
{
for(list<list<int> >::const_iterator i=l.begin();i!=l.end();i++)
printIntList(*i);
}
int main()
{
LpSolver::printList(Stderr);
lpSetSolver("cddgmp");
PolymakeFile inFile;
fprintf(Stderr,"Test\n");
inFile.open(inputOption.getValue());
fprintf(Stderr,"Test\n");
int n=inFile.readCardinalProperty("AMBIENT_DIM");
//int d=inFile.readCardinalProperty("DIM");
int nRays=inFile.readCardinalProperty("N_RAYS");
fprintf(Stderr,"%i %i\n",n,nRays);
IntegerMatrix rays=inFile.readMatrixProperty("RAYS",nRays,n);
{/* Make sure that representatives of rays are in the same subspace. */
IntegerVectorList rays2;
IntegerMatrix linealitySpace=inFile.readMatrixProperty("LINEALITY_SPACE",nRays,n);
Subspace l(linealitySpace.getRows(),linealitySpace.getWidth());
for(int i=0;i<rays.getHeight();i++)
rays2.push_back(l.canonicalizeVector(rays[i]));
rays=rowsToIntegerMatrix(rays2,n);
}
/* if(1)//just for printing - no triangulation here.
{
// int m=inFile.readCardinalProperty("NMAXCONES");
vector<list<int> > cones=inFile.readMatrixIncidenceProperty("MAXIMAL_CONES_COMPRESSED");
IntegerVectorList r;
for(int i=0;i<cones.size();i++)
{
IntegerVector v(n);
for(list<int>::const_iterator j=cones[i].begin();j!=cones[i].end();j++)
{
//AsciiPrinter(Stderr).printVector(v);fprintf(Stderr,"%i\n",*j);
v+=rays[*j];
//AsciiPrinter(Stderr).printVector(rays[*j]);fprintf(Stderr,"%i\n",*j);
}
r.push_back(v);
}
PolymakeFile outFile;
outFile.create(outputOption.getValue(),"topaz","SimplicialComplex");
outFile.writeMatrixProperty("INTERIOR_POINTS",rowsToIntegerMatrix(r));
outFile.close();
}*/
// vector<Triangulation::Cone > cones=inFile.readMatrixIncidenceProperty("MAXIMAL_CONES");
vector<list<int> > cones=inFile.readMatrixIncidenceProperty("MAXIMAL_CONES");
for(vector<list<int> >::const_iterator i=cones.begin();i!=cones.end();i++)
printIntList(*i);
AsciiPrinter(Stderr).printVectorList(rays.getRows());
vector<Triangulation::Cone> simplicialComplex;
// for(vector<Triangulation::Cone>::const_iterator i=cones.begin();i!=cones.end();i++)
for(vector<list<int> >::const_iterator i=cones.begin();i!=cones.end();i++)
{
// fprintf(Stderr,"Triangulating:\n");
// printIntList(*i);
// list<Triangulation::Cone> coneList=Triangulation::triangulate(*i,rays);
list<Triangulation::Cone> coneList=Triangulation::triangulate(*i,rays);
// fprintf(Stderr,"Result:\n");
for(list<Triangulation::Cone>::const_iterator j=coneList.begin();j!=coneList.end();j++)
{
// printIntList(*j);
simplicialComplex.push_back(*j);
}
}
PolymakeFile outFile;
outFile.create(outputOption.getValue(),"topaz","SimplicialComplex");
outFile.writeCardinalProperty("N_VERTICES",nRays);
// outFile.writeCardinalProperty("DIM",d);
outFile.writeIncidenceMatrixProperty("INPUT_FACES",Triangulation::removeOrientation(simplicialComplex),nRays);
outFile.close();
return 0;
}
};
static TriangulateApplication theApplication;
|
