Decomposition.md

@@ -38,17 +38,6 @@ weights, and the sum of the cut edges is minimal (_Find optimal decomposition_).
 the decomposition can be post-process further more to be more optimal and based on factors not considered by the optimization process, like merging vertex, or merging sub-sub-domain, to create bigger sub-domains.
  Even if a model decomposition it is not bind to a graph model it is true that until now it is the best approach in scientific computation
 
-<div id="sliderFrame">
-        <div id="slider">
-            <img src="uploads/images/domain.jpg" alt="Initial domain" />
-            <img src="uploads/images/domain_decomposed.jpg" alt="Divide the space into a grid of sub-sub-domain" />
-            <img src="uploads/images/domain_graph.jpg" alt="Generate the graph model" />
-            <img src="uploads/images/domain_graph_decomposed.jpg" alt="Find optimal decomposition" />
-            <img src="uploads/images/domain_subdomain_decomposed.jpg" alt="Post process the decomposition" />
-            <img src="uploads/images/domain_subdomain_decomposed_wg.jpg" alt="Sub-domain creation" />
-        </div>
-    </div>
-
 * CartDecomposition [(doc)](CartDecomposition)[(API reference)](http://ppmcore.mpi-cbg.de/doxygen/openfpm_pdata/classCartDecomposition.html)
 
 ### Fixed decomposition