[PPL-devel] Convex Hull

[Roberto Bagnara]

-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1


Hello Stefan.

On 09/18/14 17:38, Stefan Schupp wrote:
> a short question: What is the method to use when computing the convex hull of a C_Polyhedron?

I am not sure I understand what you mean.  A C_Polyhedron is a convex
polyhedron, i.e., i.e. it coincides with its own convex hull.  In
other words, computing the convex hull of a C_Polyhedron is a no-op.

> Currently I try minimized_generators.

What are you trying to achieve, exactly?
Kind regards,

   Roberto

- -- 
     Prof. Roberto Bagnara

Applied Formal Methods Laboratory - University of Parma, Italy
mailto:bagnara at cs.unipr.it
                              BUGSENG srl - http://bugseng.com
                              mailto:roberto.bagnara at bugseng.com
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1

iEYEARECAAYFAlQb10gACgkQiBRXy7WUQ5JkugCeMCbpXbSJFoQsPXinRnZFvhjd
cR0AnA+FtX2e0qIXi5xiwiiyZeIt6Y4y
=wJoN
-----END PGP SIGNATURE-----