applications/disjoint_union_sep.c

   1 /*       Polyhedron disjoint intersections
   2  */
   3
   4 /*
   5  disjoint_union_sep computes the disjoint union of the given list of domains.
   6  input:
   7     (integer) # of polyhedra
   8     list of polyhedra in the usual matrix (constraints) format
   9
  10  output:
  11     list of polyhedra (constraint matrices) having no integer point in common
  12 */
  13
  14 #include <stdio.h>
  15 #include <stdlib.h>
  16
  17 #include <polylib/polylib.h>
  18
  19 #define WS 0
  20
  21
  22 /* Procedure to print constraints of a domain */
  23 void AffContraintes(Polyhedron *p)
  24 {
  25         for( ;p;p=p->next)
  26         {
  27                 Polyhedron_PrintConstraints(stdout, P_VALUE_FMT, p );
  28                 printf("\n");
  29         }
  30 }
  31
  32
  33 int main() {
  34
  35         int np, i;
  36
  37         Matrix *a;
  38         Polyhedron *A, *tmp, *DD;
  39
  40         scanf( "%d", &np );
  41
  42         A = NULL;
  43         for( i=0 ; i<np ; i++ )
  44         {
  45                 a = Matrix_Read();
  46                 tmp = Constraints2Polyhedron(a,WS);
  47                 Matrix_Free(a);
  48                 tmp ->next = A;
  49                 A = tmp;
  50         }
  51
  52
  53         DD = Disjoint_Domain( A, 0, WS );
  54
  55         AffContraintes(DD);
  56
  57         Domain_Free( DD );
  58         Domain_Free( A );
  59
  60         return 0;
  61 }
  62
  63
  64