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
|
/* Polyhedron disjoint intersections
*/
/*
This file is part of PolyLib.
PolyLib 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 3 of the License, or
(at your option) any later version.
PolyLib 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 PolyLib. If not, see <http://www.gnu.org/licenses/>.
*/
/*
disjoint_union_sep computes the disjoint union of the given list of domains.
input:
(integer) # of polyhedra
list of polyhedra in the usual matrix (constraints) format
output:
list of polyhedra (constraint matrices) having no integer point in common
*/
#include <stdio.h>
#include <stdlib.h>
#include <polylib/polylib.h>
#define WS 0
/* Procedure to print constraints of a domain */
void AffContraintes(Polyhedron *p)
{
for( ;p;p=p->next)
{
Polyhedron_PrintConstraints(stdout, P_VALUE_FMT, p );
printf("\n");
}
}
int main() {
int np, i;
Matrix *a;
Polyhedron *A, *tmp, *DD;
scanf( "%d", &np );
A = NULL;
for( i=0 ; i<np ; i++ )
{
a = Matrix_Read();
tmp = Constraints2Polyhedron(a,WS);
Matrix_Free(a);
tmp ->next = A;
A = tmp;
}
DD = Disjoint_Domain( A, 0, WS );
AffContraintes(DD);
Domain_Free( DD );
Domain_Free( A );
return 0;
}
|
