Elena Fersman wrote:
Could you please help me with the minimal example to start using the library?
I have managed to quickly hack tests/intersection1.cc to provide you with a non-trivial example: call the file below the signature "inters.cc" and compile it with
g++ -W -Wall -o inters inters.cc -lppl -lgmpcc -lgmp
All the best,
Roberto
-- Prof. Roberto Bagnara Computer Science Group Department of Mathematics, University of Parma, Italy http://www.cs.unipr.it/~bagnara/ mailto:bagnara@cs.unipr.it
/* Intersection of an icosahedron with a column. Copyright (C) 2001-2003 Roberto Bagnara bagnara@cs.unipr.it
This file is part of the Parma Polyhedra Library (PPL).
The PPL 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 2 of the License, or (at your option) any later version.
The PPL 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 this program; if not, write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
For the most up-to-date information see the Parma Polyhedra Library site: http://www.cs.unipr.it/ppl/ . */
#include <ppl.hh>
using namespace std; using namespace Parma_Polyhedra_Library; using namespace Parma_Polyhedra_Library::IO_Operators;
int main() { Variable x(0); Variable y(1); Variable z(2);
C_Polyhedron icosahedron(3); icosahedron.add_constraint(4*x - 2*y - z + 14 >= 0); icosahedron.add_constraint(4*x + 2*y - z + 2 >= 0); icosahedron.add_constraint(x + y - 1 >= 0); icosahedron.add_constraint(x + y + 2*z - 5 >= 0); icosahedron.add_constraint(x + 1 >= 0); icosahedron.add_constraint(x + z - 1 >= 0); icosahedron.add_constraint(2*x + y -2*z + 7 >= 0); icosahedron.add_constraint(x - y + 2*z + 1 >= 0); icosahedron.add_constraint(x - y + 5 >= 0); icosahedron.add_constraint(2*x - y - 2*z + 13 >= 0); icosahedron.add_constraint(-2*x - y + 2*z + 1 >= 0); icosahedron.add_constraint(-x + y - 1 >= 0); icosahedron.add_constraint(-x + y -2*z + 7 >= 0); icosahedron.add_constraint(-4*x + 2*y + z - 4 >= 0); icosahedron.add_constraint(-2*x + y + 2*z - 5 >= 0); icosahedron.add_constraint(-x + 1 >= 0); icosahedron.add_constraint(-x - z + 5 >= 0); icosahedron.add_constraint(-4*x - 2*y + z + 8 >= 0); icosahedron.add_constraint(-x - y + 5 >= 0); icosahedron.add_constraint(-x - y -2*z +13 >= 0);
C_Polyhedron column(3); column.add_constraint(y >= 2); column.add_constraint(y <= 4); column.add_constraint(x >= 0); column.add_constraint(x <= 1);
C_Polyhedron computed_result = icosahedron; computed_result.intersection_assign_and_minimize(column);
C_Polyhedron known_result(3); known_result.add_constraint(-4*x - 2*y + z >= -8); known_result.add_constraint(-4*x + 2*y + z >= 4); known_result.add_constraint(-2*x - y + 2*z >= -1); known_result.add_constraint(-2*x + y + 2*z >= 5); known_result.add_constraint(-x - y - 2*z >= -13); known_result.add_constraint(-x - z >= -5); known_result.add_constraint(-x >= -1); known_result.add_constraint(-x + y - 2*z >= -7); known_result.add_constraint(-y >= -4); known_result.add_constraint(y >= 2); known_result.add_constraint(x >= 0);
int retval = (computed_result == known_result) ? 0 : 1;
cout << "*** icosahedron ***" << endl << icosahedron.constraints() << endl; cout << "*** columns ***" << endl << column.constraints() << endl; cout << "*** computed_result ***" << endl << computed_result.constraints() << endl;
return retval; }