Add method Polyhedron.convex_union()

diff --git a/doc/reference.rst b/doc/reference.rst
index 18e69c0d1b6c49e73c60cec946ad1a343c7a345b..83ee9d3964aaa99133e94e00733c09b1a5c94af2 100644 (file)
--- a/doc/reference.rst
+++ b/doc/reference.rst
@@ -2,6 +2,7 @@
 Module Reference
 ================
 
+
 Symbols
 -------
 
@@ -227,6 +228,7 @@ They are implemented by the :class:`Rational` class, that inherits from both :cl
 
     See the documentation of :class:`fractions.Fraction` for more information and examples.
 
+
 Polyhedra
 ---------
 
@@ -278,6 +280,10 @@ This space can be unbounded.
         The tuple of constraints, i.e., equalities and inequalities.
         This is semantically equivalent to: ``equalities + inequalities``.
 
+    .. method:: convex_union(polyhedron[, ...])
+
+        Return the convex union of two or more polyhedra.
+
     .. method:: widen(polyhedron)
 
         Compute the *standard widening* of two polyhedra, à la Halbwachs.

diff --git a/linpy/polyhedra.py b/linpy/polyhedra.py
index e5e25238dd69be14571f0e91217db085e3ab734a..50af0531247fd874e9eebb107e4dc05b02457d3a 100644 (file)
--- a/linpy/polyhedra.py
+++ b/linpy/polyhedra.py
@@ -144,6 +144,15 @@ class Polyhedron(Domain):
     def aspolyhedron(self):
         return self
 
+    def convex_union(self, *others):
+        """
+        Return the convex union of two or more polyhedra.
+        """
+        for other in others:
+            if not isinstance(other, Polyhedron):
+                raise TypeError('arguments must be Polyhedron instances')
+        return Polyhedron(self.union(*others))
+
     def __contains__(self, point):
         if not isinstance(point, Point):
             raise TypeError('point must be a Point instance')