hull

HULL Convex hull of n polytopes
 
 [P,Pn]=hull(Pn,Options)

 ---------------------------------------------------------------------------
 DESCRIPTION
 ---------------------------------------------------------------------------
 Computes a convex hull of n polytopes given by the polytope array Pn

 USAGE:
   P = hull([P1 P2 P3])
   P = hull(Pn,Options)
   [P,Pn] = hull(Pn)
   [P,Pn] = hull(Pn,Options)

 NOTE:
   Convex hull requires computing extreme points, what can be expensive.
   Thats why also the second output argument should be always retrieved,
   since once the extreme points are computed for the input argument,
   they can be stored for future faster calculation
   (see help extreme)

 ---------------------------------------------------------------------------
 INPUT
 ---------------------------------------------------------------------------
 Pn                      - Polytope array
 Options.extreme_solver  - Which method to use for vertex enumeration
                           (0 - brute force enumeration, 3 - CDD)
                           (see help mpt_init)
 Options.verbose         - Level of verbosity

 Note: If Options is missing or some of the fields are not defined, the default
       values from mptOptions will be used

 ---------------------------------------------------------------------------
 OUTPUT                                                                                                    
 ---------------------------------------------------------------------------
 P     - convex hull of polytopes stored in Pn
 Pn    - extreme points have been computed and stored for the input argument

 see also ENVELOPE, UNION, EXTREME