merge

MERGE merges polytopes together

 [Pm, details] = merge(Pn, Options)

 ---------------------------------------------------------------------------
 DESCRIPTION
 ---------------------------------------------------------------------------
 Uses either greedy merging or optimal merging to join regions.

 ---------------------------------------------------------------------------
 INPUT
 ---------------------------------------------------------------------------
 Pn  - polytope array
 Options.greedy    - if set to 1 (default), uses greedy merging. If set to
                     0, optimal merging will be used (may be slow, requires
                     espresso solver to be installed)
 Options.Pn_convex - if Pn is convex this should be set to 1 to avoid slowdown
                     and unnecessary increase of complexity. (default 0)
 Options.verbose   - level of verbosity (0/1/2)
 Options.trials    - for greedy merging, defines number of trials to
                     improve the solution (default is 1, corresponds to 1 run)

 NOTE!!! if optimal merging is used (Options.greedy=0), then the result might
 contain overlaps! if you do not want them, you must additionaly specify
 Options.algo, see 'help mpt_optMerge' for more details.

 ---------------------------------------------------------------------------
 OUTPUT                                                                                                    
 ---------------------------------------------------------------------------
 Pm               - merged polytopes
 details.before   - number of polytopes before merging
 details.after    - number of polytopes after merging
 details.runTime  - run time of the algorithm
 details.alg      - string, either 'greedy' or 'optimal'

 see also MPT_GREEDYMERGING, MPT_OPTMERGE