One solution would be to compute the volume of P, Q, and intersect(P,Q). All three are convex, so its easy enough to compute the volumes. Then
Vol(union(P,Q)) = Vol(P) + Vol(Q) - Vol(intersect(P,Q)) <= Vol(conv(P,Q)) with equality if and only if union(P,Q) is already convex. I don't quite understand the second part, a list of equations is just some hyperplane arrangement. This will have many polyhedral cells... -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org