-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA512
Hello Roberto,
my goal was to calculate some kind of Minkowski sum. A very unefficient and simplistic approach would be to create the decomposition of the addition (So simply add all vertices of P1 to all vertices of P2) and after that compute the convex hull to drop interior points.
As my polyhedra are represented by Pointgenerators I create a new polyhedron by applying the method above to the generators. I thought after that a minimization of the generator set should do the trick.
Best regards, Stefan
Am 19/09/14 09:12, schrieb Roberto Bagnara:
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
- -- Stefan Schupp M.Sc. RWTH Aachen University Computer Science Department, Informatik 2 D-52056 Aachen, Germany http://www-i2.informatik.rwth-aachen.de/i2/schupp/ Tel.: +49 241 80 21243