Application: gvSIG desktop » gvSIG geoprocess

org.gvsig.geoprocess.algorithm.fusespatially.FuseSpatiallyLibrary

#

# gvSIG. Desktop Geographic Information System.

#

# Copyright (C) 2007-2012 gvSIG Association.

#

# This program is free software; you can redistribute it and/or

# modify it under the terms of the GNU General Public License

# as published by the Free Software Foundation; either version 2

# of the License, or (at your option) any later version.

#

# This program is distributed in the hope that it will be useful,

# but WITHOUT ANY WARRANTY; without even the implied warranty of

# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the

# GNU General Public License for more details.

#

# You should have received a copy of the GNU General Public License

# along with this program; if not, write to the Free Software

# Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,

# MA  02110-1301, USA.

#

# For any additional information, do not hesitate to contact us

# at info AT gvsig.com, or visit our website www.gvsig.com.

#

basic_vect_algorithms=Capas vectoriales

Input_layer=Capa de entrada

Selected_geometries_fuse=Geom. seleccionadas (Capa entrada)

Field=Campo

Function_list=Lista de funciones

fusespatially=Fusionar espacialmente

fuse_spatially=Fusionar espacialmente

summary_function=Funci?n resumen

adjacent_geometries_only=Solo geometrias adyacentes

#

# gvSIG. Desktop Geographic Information System.

#

# Copyright (C) 2007-2012 gvSIG Association.

#

# This program is free software; you can redistribute it and/or

# modify it under the terms of the GNU General Public License

# as published by the Free Software Foundation; either version 2

# of the License, or (at your option) any later version.

#

# This program is distributed in the hope that it will be useful,

# but WITHOUT ANY WARRANTY; without even the implied warranty of

# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the

# GNU General Public License for more details.

#

# You should have received a copy of the GNU General Public License

# along with this program; if not, write to the Free Software

# Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,

# MA  02110-1301, USA.

#

# For any additional information, do not hesitate to contact us

# at info AT gvsig.com, or visit our website www.gvsig.com.

#

basic_vect_algorithms=Vector layers tools

Input_layer=Input cover

Selected_geometries_fuse=Selected geometries (Input cover)

Field=Field

Function_list=Function list

fusespatially=Fuse spatially

fuse_spatially=Fuse spatially

summary_function=Summary function

adjacent_geometries_only=Only dissolve adjacent

groupby=Group by a field

<?xml version='1.0' encoding='ISO-8859-1' standalone='yes' ?>

<!--

    gvSIG. Desktop Geographic Information System.

    Copyright (C) 2007-2012 gvSIG Association.

    This program is free software; you can redistribute it and/or

    modify it under the terms of the GNU General Public License

    as published by the Free Software Foundation; either version 2

    of the License, or (at your option) any later version.

    This program is distributed in the hope that it will be useful,

    but WITHOUT ANY WARRANTY; without even the implied warranty of

    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the

    GNU General Public License for more details.

    You should have received a copy of the GNU General Public License

    along with this program; if not, write to the Free Software

    Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,

    MA  02110-1301, USA.

    For any additional information, do not hesitate to contact us

    at info AT gvsig.com, or visit our website www.gvsig.com.

-->

	<help>

		<element name="DESCRIPTION" text="This geoprocess works with one only input layer, whose geometry type must be polygon. This process analize each input geometry and builds a unique polygon with all geometries which intersects each other. The attribute table will have an identifier field of each feature. <BR> Furthermore, other layer with only alphanumeric data will be created. This alphanumeric table will contain the table of the input layer and it will include a identifier field with a reference to the polygon in the first layer. In this way, each polygon in the first layer will have a reference to each feature in the second layer." description="Descripci&#243;n" type="0">

			<image description="" file="fusespatiallydesc.png">

			</image>

		</element>

		<element name="ADDITIONAL_INFO" text="" description="Informaci&#243;n adicional" type="0">

		</element>

		<element name="EXTENSION_AUTHOR" text="Nacho Brodin" description="Algoritmo creado por" type="0">

		</element>

		<element name="HELP_AUTHOR" text="" description="Ayuda creada por" type="0">

		</element>

		<element name="USER_NOTES" text="" description="Notas de usuario" type="0">

		</element>

		<element name="LAYER" text="" description="Capa de entrada" type="3">

		</element>

		<element name="SELECTED_GEOM" text="" description="Geometrias seleccionadas" type="3">

		</element>

		<element name="DISSOLV_ADJ" text="" description="Geometrias seleccionadas" type="3">

		</element>

		<element name="FIELD" text="" description="Campo" type="3">

		</element>

		<element name="FUNCTION_LIST" text="" description="Lista de funciones" type="3">

		</element>

		<element name="OUTPUT_DESCRIPTION" text="" description="Descripci&#243;n" type="2">

		</element>

		<element name="RESULT" text="" description="Disolver" type="2">

		</element>

	</help>

<?xml version='1.0' encoding='ISO-8859-1' standalone='yes' ?>

<?xml version='1.0' encoding='ISO-8859-1' standalone='yes' ?>

<!--

    gvSIG. Desktop Geographic Information System.

    Copyright (C) 2007-2012 gvSIG Association.

    This program is free software; you can redistribute it and/or

    modify it under the terms of the GNU General Public License

    as published by the Free Software Foundation; either version 2

    of the License, or (at your option) any later version.

    This program is distributed in the hope that it will be useful,

    but WITHOUT ANY WARRANTY; without even the implied warranty of

    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the

    GNU General Public License for more details.

    You should have received a copy of the GNU General Public License

    along with this program; if not, write to the Free Software

    Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,

    MA  02110-1301, USA.

    For any additional information, do not hesitate to contact us

    at info AT gvsig.com, or visit our website www.gvsig.com.

-->

	<help>

		<element name="DESCRIPTION" text="Este geoproceso act&#250;a sobre una sola capa de entrada, cuyo tipo de geometr&#237;a ha de ser forzosamente de pol&#237;gonos. El proceso analiza cada pol&#237;gono de la capa de entrada, de tal forma que fusionar&#225; en un solo pol&#237;gono aquellos pol&#237;gonos que coincidan espacialmente, es decir que intersequen entre ellos. La tabla de atributos de los pol?gonos resultantes estar? formada por un campo ID que ser? el identificador del fen?meno. <BR> Adicionalmente se crear? otra capa que contendr? ?nicamente informaci?n alfanum?rica con la tabla de datos de la capa de origen. Adem?s incluir? un campo ID en el que tendr? la referencia al ID de la capa de pol?gonos creada. De esta forma, cada pol?gono har? referencia con su ID a una o varias entradas de la capa unicamente alfanum?rica para identificar la informaci?n asociada originalmente a cada pol?gono de la capa." description="Descripci&#243;n" type="0">

			<image description="" file="fusespatiallydesc.png">

			</image>

		</element>

		<element name="ADDITIONAL_INFO" text="" description="Informaci&#243;n adicional" type="0">

		</element>

		<element name="EXTENSION_AUTHOR" text="Nacho Brodin" description="Algoritmo creado por" type="0">

		</element>

		<element name="HELP_AUTHOR" text="" description="Ayuda creada por" type="0">

		</element>

		<element name="USER_NOTES" text="" description="Notas de usuario" type="0">

		</element>

		<element name="LAYER" text="" description="Capa de entrada" type="3">

		</element>

		<element name="SELECTED_GEOM" text="" description="Geometrias seleccionadas" type="3">

		</element>

		<element name="DISSOLV_ADJ" text="" description="Geometrias seleccionadas" type="3">

		</element>

		<element name="FIELD" text="" description="Campo" type="3">

		</element>

		<element name="FUNCTION_LIST" text="" description="Lista de funciones" type="3">

		</element>

		<element name="OUTPUT_DESCRIPTION" text="" description="Descripci&#243;n" type="2">

		</element>

		<element name="RESULT" text="" description="Disolver" type="2">

		</element>

	</help>

<?xml version='1.0' encoding='ISO-8859-1' standalone='yes' ?>

/**

 * gvSIG. Desktop Geographic Information System.

 *

 * Copyright (C) 2007-2012 gvSIG Association.

 *

 * This program is free software; you can redistribute it and/or

 * modify it under the terms of the GNU General Public License

 * as published by the Free Software Foundation; either version 2

 * of the License, or (at your option) any later version.

 *

 * This program is distributed in the hope that it will be useful,

 * but WITHOUT ANY WARRANTY; without even the implied warranty of

 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the

 * GNU General Public License for more details.

 *

 * You should have received a copy of the GNU General Public License

 * along with this program; if not, write to the Free Software

 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,

 * MA  02110-1301, USA.

 *

 * For any additional information, do not hesitate to contact us

 * at info AT gvsig.com, or visit our website www.gvsig.com.

 */

/*

 * gvSIG. Sistema de Informaci?n Geogr?fica de la Generalitat Valenciana

 *

 * Copyright (C) 2010 Generalitat Valenciana.

 *

 * This program is free software; you can redistribute it and/or

 * modify it under the terms of the GNU General Public License

 * as published by the Free Software Foundation; either version 2

 * of the License, or (at your option) any later version.

 *

 * This program is distributed in the hope that it will be useful,

 * but WITHOUT ANY WARRANTY; without even the implied warranty of

 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the

 * GNU General Public License for more details.

 *

 * You should have received a copy of the GNU General Public License

 * along with this program; if not, write to the Free Software

 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307,USA.

 */

package org.gvsig.geoprocess.algorithm.fusespatially;

import java.util.ArrayList;

import java.util.List;

import java.util.Stack;

import org.gvsig.fmap.dal.exception.DataException;

import org.gvsig.fmap.dal.feature.EditableFeature;

import org.gvsig.fmap.dal.feature.Feature;

import org.gvsig.fmap.dal.feature.FeatureAttributeDescriptor;

import org.gvsig.fmap.dal.feature.FeatureStore;

import org.gvsig.fmap.geom.GeometryLocator;

import org.gvsig.fmap.geom.GeometryManager;

import org.gvsig.fmap.geom.exception.CreateGeometryException;

import org.gvsig.geoprocess.algorithm.base.core.DALFeaturePersister;

import org.gvsig.geoprocess.algorithm.base.core.GeometryOperation;

import org.gvsig.geoprocess.algorithm.base.util.GeometryUtil;

import org.gvsig.geoprocess.lib.sextante.AbstractSextanteGeoProcess;

import com.vividsolutions.jts.geom.Geometry;

/**

 * Fuse spatially operation

 * @author <a href="mailto:nachobrodin@gmail.com">Nacho Brodin</a>

 * @deprecated Uses FuseSpatiallyOperationFast

 */

public class FuseSpatiallyOperation extends GeometryOperation {

	protected GeometryManager                geomManager           = GeometryLocator.getGeometryManager();

	private int                              id                    = 0;

	private List<Feature>                    featList              = null;

	private FeatureStore                     outFeatureStoreTable  = null;

	private String                           idField               = "FID";

	public FuseSpatiallyOperation(List<Feature> f, 

			FeatureStore outFeatStoreTable, 

			String[] fieldNames, 

			String idField, 

			AbstractSextanteGeoProcess p) throws DataException {

		super(p);

		this.featList = f;

		this.outFeatureStoreTable = outFeatStoreTable;

		this.idField = idField;

	}

	public FuseSpatiallyOperation(Stack<Feature> f, 

			FeatureStore outFeatStoreTable, 

			String[] fieldNames, 

			AbstractSextanteGeoProcess p) throws DataException {

		super(p);

		this.featList = f;

		this.outFeatureStoreTable = outFeatStoreTable;

	}

	/*

	 * (non-Javadoc)

	 * @see org.gvsig.geoprocess.algorithm.base.core.GeometryOperation#invoke(org.gvsig.fmap.geom.Geometry, org.gvsig.fmap.dal.feature.Feature)

	 */

	public EditableFeature invoke(org.gvsig.fmap.geom.Geometry g, Feature feature) {

		try {

			Geometry jtsInputGeom = GeometryUtil.geomToJTS(g);

			insertInTable(feature);

			int cont = featList.size() - 1;

			while(cont >= 0 && !process.getTaskMonitor().isCanceled()) {

				Feature f = featList.get(cont);

				g = f.getDefaultGeometry();

				Geometry jtsGeom = GeometryUtil.geomToJTS(g); //Multigeometry support

				if(jtsGeom.intersects(jtsInputGeom)) {

					jtsInputGeom = jtsInputGeom.union(jtsGeom);

					featList.remove(cont);

					process.setProgress(procesSize - featList.size(), procesSize);

					cont = featList.size();

					insertInTable(f);

				}

				cont --;

			}

			//Cuando no genera dos capas mete los campos de la feature de entrada en la de salida perdiendose el resto

			if(outFeatureStoreTable == null) { 

				String[] fieldNames = persister.getFieldNamesWithoutGeom();

				ArrayList<String> fields = new ArrayList<String>();

				ArrayList<Object> values = new ArrayList<Object>();

				fields.add(idField);

				values.add(id);

				for (int j = 0; j < fieldNames.length; j++) {

					Object obj = feature.get(fieldNames[j]);

					if(obj != null && fieldNames[j].compareTo(idField) != 0) {

						fields.add(fieldNames[j]);

						values.add(obj);

					}

				}

				lastEditFeature = persister.addFeature(jtsInputGeom, fields, values);

			} else

				lastEditFeature = persister.addFeature(jtsInputGeom, idField, id);

		} catch (DataException e) {

			return null;

		} catch (CreateGeometryException e) {

			return null;

		}

		id++;

		return lastEditFeature;

	}

	private void insertInTable(Feature f) throws DataException {

		if(outFeatureStoreTable == null)

			return;

		EditableFeature edFeat = outFeatureStoreTable.createNewFeature();

		edFeat.set(idField, id);

		FeatureAttributeDescriptor[] attrList = f.getType().getAttributeDescriptors();

		for (int j = 0; j < attrList.length; j++) {

			if(attrList[j].getName().compareTo("GEOMETRY") != 0) {

				edFeat.set(attrList[j].getName(), f.get(attrList[j].getName()));

			}

		}

		outFeatureStoreTable.insert(edFeat);

	}

	/**

	 * Removes duplicate fields

	 * @param names

	 * @return

	 */

	public static String[] checkFields(String[] names) {

		if(names.length <= 1)

			return names;

		int cont = 0;

		int i = 1;

		while(i < names.length) {

			if(names[0].compareTo(names[i]) == 0) {

				names[0] = "FID_" + cont;

				i = 0;

				cont ++;

			}

			i ++;

		}

		return names;

	}

	/*

	 * (non-Javadoc)

	 * @see org.gvsig.geoprocess.algorithm.base.core.GeometryOperation#invoke(org.gvsig.fmap.geom.Geometry, org.gvsig.fmap.dal.feature.EditableFeature)

	 */

	public void invoke(org.gvsig.fmap.geom.Geometry g, EditableFeature feature) {

		if(g == null)

			return;

	}

	/*

	 * (non-Javadoc)

	 * @see org.gvsig.geoprocess.algorithm.base.core.IOperation#getResult()

	 */

	public Object getResult() {

		return lastEditFeature;

	}

	public DALFeaturePersister getWriter() {

		return persister;

	}

}

/**

 * gvSIG. Desktop Geographic Information System.

 *

 * Copyright (C) 2007-2012 gvSIG Association.

 *

 * This program is free software; you can redistribute it and/or

 * modify it under the terms of the GNU General Public License

 * as published by the Free Software Foundation; either version 2

 * of the License, or (at your option) any later version.

 *

 * This program is distributed in the hope that it will be useful,

 * but WITHOUT ANY WARRANTY; without even the implied warranty of

 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the

 * GNU General Public License for more details.

 *

 * You should have received a copy of the GNU General Public License

 * along with this program; if not, write to the Free Software

 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,

 * MA  02110-1301, USA.

 *

 * For any additional information, do not hesitate to contact us

 * at info AT gvsig.com, or visit our website www.gvsig.com.

 */

/*

 * gvSIG. Sistema de Informaci?n Geogr?fica de la Generalitat Valenciana

 *

 * Copyright (C) 2010 Generalitat Valenciana.

 *

 * This program is free software; you can redistribute it and/or

 * modify it under the terms of the GNU General Public License

 * as published by the Free Software Foundation; either version 2

 * of the License, or (at your option) any later version.

 *

 * This program is distributed in the hope that it will be useful,

 * but WITHOUT ANY WARRANTY; without even the implied warranty of

 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the

 * GNU General Public License for more details.

 *

 * You should have received a copy of the GNU General Public License

 * along with this program; if not, write to the Free Software

 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307,USA.

 */

package org.gvsig.geoprocess.algorithm.fusespatially;

import java.util.ArrayList;

import java.util.List;

import org.gvsig.fmap.dal.exception.DataException;

import org.gvsig.fmap.dal.feature.EditableFeature;

import org.gvsig.fmap.dal.feature.Feature;

import org.gvsig.fmap.dal.feature.FeatureAttributeDescriptor;

import org.gvsig.fmap.dal.feature.FeatureSelection;

import org.gvsig.fmap.dal.feature.FeatureSet;

import org.gvsig.fmap.dal.feature.FeatureStore;

import org.gvsig.fmap.geom.exception.CreateGeometryException;

import org.gvsig.geoprocess.algorithm.base.core.GeometryOperation;

import org.gvsig.geoprocess.algorithm.base.util.GeometryUtil;

import org.gvsig.geoprocess.algorithm.base.util.JTSFacade;

import org.gvsig.geoprocess.lib.sextante.AbstractSextanteGeoProcess;

import org.slf4j.Logger;

import org.slf4j.LoggerFactory;

import com.vividsolutions.jts.geom.Geometry;

import java.util.Iterator;

/**

 * Fuse spatially operation

 *

 * @author <a href="mailto:nachobrodin@gmail.com">Nacho Brodin</a>

 */

public class FuseSpatiallyOperationFast2 extends GeometryOperation {

    private static Logger logger = LoggerFactory.getLogger(FuseSpatiallyOperationFast2.class.getName());

    private ArrayList<Element> featureList = null;

    private String nameIdField = null;

    private FeatureStore outFeatStoreTable = null;

    private NodeTree baseTree = null;

    class Element {

        public int id = -1;

        public Feature feat = null;

        public List<Element> overlapList = new ArrayList<Element>();

        public boolean insertedToJoin = false;

        public Geometry jtsGeom = null;

    }

    class NodeTree {

        public Element element = null;

        public int pos = 0;

        public NodeTree parent = null;

        public NodeTree(Element node, NodeTree parent) {

            this.element = node;

            this.parent = parent;

        }

        public Element getNext() {

            if (pos < element.overlapList.size()) {

                return element.overlapList.get(pos++);

            }

            return null;

        }

    }

    public FuseSpatiallyOperationFast2(AbstractSextanteGeoProcess process) {

        super(process);

        featureList = new ArrayList<Element>();

    }

    @Override

    public EditableFeature invoke(org.gvsig.fmap.geom.Geometry g,

            Feature featureInput) {

        // TODO Auto-generated method stub

        return null;

    }

    @Override

    public void invoke(org.gvsig.fmap.geom.Geometry g,

            EditableFeature featureInput) {

        // TODO Auto-generated method stub

    }

    /**

     * Computes a complete operation over the input FeatureStore. The result of

     * this operation is stored in the output FeatureStore. This method will

     * call once for each geometry.

     *

     * @param inFeatStore Input FeatureStore

     * @param outFeatStore Output FeatureStore

     * @param outFeatStoreTable

     * @param attrNames List of attributes to build the output feature store

     * @param attrNamesTable

     * @param selectedGeomInput

     * @param selectedGeomOutput

     * @param idField

     * @param selectedGeom If it is true only the selected geometries will be

     * processed

     * @throws DataException

     */

    @SuppressWarnings("deprecation")

    public void computesGeometryOperation(FeatureStore inFeatStore,

            FeatureStore outFeatStore,

            FeatureStore outFeatStoreTable,

            String[] attrNames,

            String[] attrNamesTable,

            boolean selectedGeomInput,

            boolean selectedGeomOutput,

            String idField) throws DataException {

        this.outFeatStoreTable = outFeatStoreTable;

        this.nameIdField = idField;

        this.inFeatureStore = inFeatStore;

        this.selectedGeomInput = selectedGeomInput;

        this.selectedGeomOverlay = selectedGeomOutput;

        FeatureSet featuresSet = null;

        featuresSet = inFeatStore.getFeatureSet();

        setFeatureStore(outFeatStore, attrNames);

        Iterator it = null;

        if (selectedGeomInput) {

            FeatureSelection ds = inFeatStore.getFeatureSelection();

            it = ds.iterator();

            numberOfFeatures = (int) ds.getSelectedCount();

        } else {

            it = featuresSet.iterator();

            numberOfFeatures = (int) featuresSet.getSize();

        }

        if (status != null) {

            status.setRangeOfValues(0, numberOfFeatures);

        }

        if (process != null) {

            process.setProgress(0, numberOfFeatures);

        }

        //Crear lista de elementos

        int iCount = 0;

        while (it.hasNext() && !process.getTaskMonitor().isCanceled()) {

            Feature feat = ((Feature) it.next()).getCopy();

            Element el = new Element();

            el.feat = feat;

            el.id = iCount;

            featureList.add(el);

            if (status != null && process != null) {

                status.setCurValue(iCount);

            }

            if (process != null) {

                process.setProgress(iCount, numberOfFeatures);

            }

            iCount++;

        }

//		it.dispose();

        //Crear listas de solapes para cada feature

        iCount = 0;

        while (iCount < featureList.size() && !process.getTaskMonitor().isCanceled()) {

            Element elem1 = featureList.get(iCount);

            org.gvsig.fmap.geom.Geometry geom1 = elem1.feat.getDefaultGeometry();

            if (status != null) {

                status.setCurValue(iCount);

            }

            if (process != null) {

                process.setProgress(iCount, numberOfFeatures);

            }

            for (int i = iCount + 1; i < featureList.size(); i++) {

                Element elem2 = featureList.get(i);

                org.gvsig.fmap.geom.Geometry geom2 = elem2.feat.getDefaultGeometry();

                if (areBBoxesOverlaping(geom1, geom2)) {

                    if (elem1.jtsGeom == null) {

                        elem1.jtsGeom = GeometryUtil.geomToJTS(geom1);

                    }

                    elem2.jtsGeom = GeometryUtil.geomToJTS(geom2);

                    if (elem1.jtsGeom.intersects(elem2.jtsGeom)) {

                        elem1.overlapList.add(elem2);

                        elem2.overlapList.add(elem1);

                    }

                }

            }

            iCount++;

        }

        iCount = 0;

        int iFeat = 0;

        while (iCount < featureList.size() && !process.getTaskMonitor().isCanceled()) {

            Element elem1 = featureList.get(iCount);

            if (status != null) {

                status.setCurValue(iCount);

            }

            if (process != null) {

                process.setProgress(iCount, numberOfFeatures);

            }

            if (!elem1.insertedToJoin) {

                buildListToJoin(elem1, iFeat);

                iFeat++;

            }

            iCount++;

        }

        if (persister != null) {

            persister.end();

        }

    }

    private boolean areBBoxesOverlaping(org.gvsig.fmap.geom.Geometry g1, org.gvsig.fmap.geom.Geometry g2) {

        if (g1.getEnvelope().getMaximum(0) < g2.getEnvelope().getMinimum(0)) {

            return false;

        }

        if (g1.getEnvelope().getMinimum(0) > g2.getEnvelope().getMaximum(0)) {

            return false;

        }

        if (g1.getEnvelope().getMaximum(1) < g2.getEnvelope().getMinimum(1)) {

            return false;

        }

        if (g1.getEnvelope().getMinimum(1) > g2.getEnvelope().getMaximum(1)) {

            return false;

        }

        return true;

    }

    /**

     * Computes the union of the list of geometries

     *

     * @param listResult

     * @param elem1

     * @return

     */

    private Geometry computesUnion(List<Geometry> listResult, Element elem1) {

        int splitValue = 500;

        Geometry newGeom = null;

        if (listResult.size() > splitValue) {

            List<List<Geometry>> list = splitList(listResult, splitValue);

            List<Geometry> result = new ArrayList<Geometry>();

            for (int i = 0; i < list.size(); i++) {

                Geometry aux = GeometryUtil.geometryUnion(list.get(i), elem1.feat.getDefaultGeometry().getGeometryType().getType());

                result.add(aux);

            }

            for (int i = 0; i < result.size(); i++) {

                newGeom = GeometryUtil.geometryUnion(result, elem1.feat.getDefaultGeometry().getGeometryType().getType());

            }

        } else {

            newGeom = GeometryUtil.geometryUnion(listResult, elem1.feat.getDefaultGeometry().getGeometryType().getType());

        }

        return newGeom;

    }

    private Geometry computesUnion2(List<Geometry> listResult, Element elem1) {

        Geometry newGeom = null;

        for (int i = 1; i < listResult.size(); i++) {

            if (i == 1) {

                newGeom = JTSFacade.union(listResult.get(0), listResult.get(1));

            } else {

                newGeom = JTSFacade.union(newGeom, listResult.get(i));

            }

        }

        return newGeom;

    }

    private Geometry computesUnion3(List<Geometry> listResult) {

        Geometry newGeom = null;

        int iCount = 0;

        int max = listResult.size();

        if (process != null) {

            process.setName("Generating union");

        }

        while (listResult.size() > 1) {

            List<Geometry> list = new ArrayList<Geometry>();

            if (status != null) {

                status.setCurValue(iCount);

            }

            if (process != null) {

                process.setProgress(iCount, max);

            }

            for (int i = 0; i < listResult.size(); i = i + 2) {

                if (i == (listResult.size() - 1)) {

                    list.add(listResult.get(i));

                } else {

                    newGeom = JTSFacade.union(listResult.get(i), listResult.get(i + 1));

                    list.add(newGeom);

                }

            }

            listResult = list;

        }

        return newGeom;

    }

    /**

     * Splits the array of geometries to compute its union because JTS cannot

     * support a lot of geometries

     *

     * @param list

     * @param n

     * @return

     */

    private List<List<Geometry>> splitList(List<Geometry> list, int n) {

        int elements = (int) (list.size() / n);

        List<List<Geometry>> l = new ArrayList<List<Geometry>>();

        for (int i = 0; i < elements; i++) {

            l.add(list.subList((i * n), (i * n) + n));

        }

        if (elements * n < list.size()) {

            l.add(list.subList((elements * n), list.size()));

        }

        return l;

    }

    /**

     * Builds the union of all lists

     *

     * @param listResult

     * @param listToJoin

     */

    private void buildListToJoin(Element elem, int iFeat) {

        Geometry newGeom = null;

        if (elem.overlapList.size() == 0) {

            if (!elem.insertedToJoin) {

                elem.insertedToJoin = true;

            }

            try {

                insertInTable(outFeatStoreTable, elem.feat, iFeat);

                addFeatureToOutput(elem.feat.getDefaultGeometry(), elem.feat, iFeat);

            } catch (DataException e) {

                logger.info("Imposible insertar en la tabla", e);

            } catch (CreateGeometryException e) {

                logger.info("Error a?adiendo geometr?a", e);

            }

        } else {

            List<Geometry> listResult = new ArrayList<Geometry>();

            NodeTree subtree = new NodeTree(elem, null);

            //Hacemos un recorrido en profundidad del ?rbol para a?adir

            //todos los elementos a la lista de geometrias a unir sin

            //repetir ninguna.

            while (subtree != null) {

                if (!subtree.element.insertedToJoin) {

                    listResult.add(subtree.element.jtsGeom);

                    try {

                        insertInTable(outFeatStoreTable, subtree.element.feat, iFeat);

                    } catch (DataException e) {

                        logger.info("Imposible insertar en la tabla", e);

                    }

                    subtree.element.insertedToJoin = true;

                }

                boolean back = false;

                Element l = subtree.getNext();

                if (l == null) {

                    back = true;

                }

                while (!back && l.insertedToJoin) {

                    l = subtree.getNext();

                    if (l == null) {

                        back = true;

                    }

                }

                if (back) {

                    subtree = subtree.parent;

                    continue;

                }

                subtree = new NodeTree(l, subtree);

            }

            newGeom = computesUnion3(listResult);

            try {

                addFeatureToOutput(newGeom, elem.feat, iFeat);

            } catch (DataException e) {

                logger.info("Imposible insertar en la tabla", e);

            } catch (CreateGeometryException e) {

                logger.info("Error a?adiendo geometr?a", e);

            }

        }

    }

    /**

     * Adds a feature to the output

     *

     * @param newGeom

     * @param feat

     * @param newFeatID

     * @throws DataException

     * @throws CreateGeometryException

     */

    private void addFeatureToOutput(org.gvsig.fmap.geom.Geometry newGeom,

            Feature feat,

            int newFeatID) throws DataException, CreateGeometryException {

        //Si hay una tabla aparte esta capa solo lleva el id como referencia a la tabla de campos

        if (outFeatStoreTable != null) {

            lastEditFeature = persister.addFeature(newGeom, nameIdField, newFeatID);

        } else {

            //Si no hay tabla se ponen todos los campos de la tabla de entrada

            String[] fieldNames = persister.getFieldNamesWithoutGeom();

            ArrayList<String> fields = new ArrayList<String>();

            ArrayList<Object> values = new ArrayList<Object>();

            fields.add(nameIdField);

            values.add(newFeatID);

            for (int j = 0; j < fieldNames.length; j++) {

                Object obj = feat.get(fieldNames[j]);

                if (obj != null && fieldNames[j].compareTo(nameIdField) != 0) {

                    fields.add(fieldNames[j]);

                    values.add(obj);

                }

            }

            lastEditFeature = persister.addFeature(newGeom, fields, values);

        }

    }

    /**

     * Adds a feature to the output

     *

     * @param newGeom

     * @param feat

     * @param newFeatID

     * @throws DataException

     * @throws CreateGeometryException

     */

    private void addFeatureToOutput(Geometry newGeom,

            Feature feat,

            int newFeatID) throws DataException, CreateGeometryException {

        //Si hay una tabla aparte esta capa solo lleva el id como referencia a la tabla de campos

        if (outFeatStoreTable != null) {

            lastEditFeature = persister.addFeature(newGeom, nameIdField, newFeatID);

        } else {

            //Si no hay tabla se ponen todos los campos de la tabla de entrada

            String[] fieldNames = persister.getFieldNamesWithoutGeom();

            ArrayList<String> fields = new ArrayList<String>();

            ArrayList<Object> values = new ArrayList<Object>();

            fields.add(nameIdField);

            values.add(newFeatID);

            for (int j = 0; j < fieldNames.length; j++) {

                if (fieldNames[j].compareTo(nameIdField) != 0) {

                    Object obj = feat.get(fieldNames[j]);

                    if (obj != null) {

                        fields.add(fieldNames[j]);

                        values.add(obj);

                    }

                }

            }

            lastEditFeature = persister.addFeature(newGeom, fields, values);

        }

    }

    /**

     * Insert in the output table a new feature with the fields of the input

     * feature. Moreover exists a field that is an identifier which is a

     * reference to the fusion layer.

     *

     * @param outFeatureStoreTable

     * @param f

     * @throws DataException

     */

    private void insertInTable(FeatureStore outFeatureStoreTable, Feature f, int reference) throws DataException {

        if (outFeatureStoreTable == null) {

            return;

        }

        EditableFeature edFeat = outFeatureStoreTable.createNewFeature();

        edFeat.set(nameIdField, reference);

        FeatureAttributeDescriptor[] attrList = f.getType().getAttributeDescriptors();

        for (int j = 0; j < attrList.length; j++) {

            if (attrList[j].getName().compareTo("GEOMETRY") != 0) {

                edFeat.set(attrList[j].getName(), f.get(attrList[j].getName()));

            }

        }

        outFeatureStoreTable.insert(edFeat);

    }

}

/**

 * gvSIG. Desktop Geographic Information System.

 *

 * Copyright (C) 2007-2012 gvSIG Association.

 *

 * This program is free software; you can redistribute it and/or

 * modify it under the terms of the GNU General Public License

 * as published by the Free Software Foundation; either version 2

 * of the License, or (at your option) any later version.

 *

 * This program is distributed in the hope that it will be useful,

 * but WITHOUT ANY WARRANTY; without even the implied warranty of

 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the

 * GNU General Public License for more details.

 *

 * You should have received a copy of the GNU General Public License

 * along with this program; if not, write to the Free Software

 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,

 * MA  02110-1301, USA.

 *

 * For any additional information, do not hesitate to contact us

 * at info AT gvsig.com, or visit our website www.gvsig.com.

 */

/*

 * gvSIG. Sistema de Informaci?n Geogr?fica de la Generalitat Valenciana

 *

 * Copyright (C) 2010 Generalitat Valenciana.

 *

 * This program is free software; you can redistribute it and/or

 * modify it under the terms of the GNU General Public License

 * as published by the Free Software Foundation; either version 2

 * of the License, or (at your option) any later version.

 *

 * This program is distributed in the hope that it will be useful,

 * but WITHOUT ANY WARRANTY; without even the implied warranty of

 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the

 * GNU General Public License for more details.

 *

 * You should have received a copy of the GNU General Public License

 * along with this program; if not, write to the Free Software

 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307,USA.

 */

package org.gvsig.geoprocess.algorithm.fusespatially;

import java.util.ArrayList;

import java.util.List;

import org.gvsig.fmap.dal.exception.DataException;

import org.gvsig.fmap.dal.feature.EditableFeature;

import org.gvsig.fmap.dal.feature.Feature;

import org.gvsig.fmap.dal.feature.FeatureAttributeDescriptor;

import org.gvsig.fmap.dal.feature.FeatureSelection;

import org.gvsig.fmap.dal.feature.FeatureSet;

import org.gvsig.fmap.dal.feature.FeatureStore;

import org.gvsig.fmap.geom.exception.CreateGeometryException;

import org.gvsig.geoprocess.algorithm.base.core.GeometryOperation;

import org.gvsig.geoprocess.algorithm.base.util.GeometryUtil;

import org.gvsig.geoprocess.algorithm.base.util.JTSFacade;

import org.gvsig.geoprocess.lib.sextante.AbstractSextanteGeoProcess;

import org.slf4j.Logger;

import org.slf4j.LoggerFactory;

import com.vividsolutions.jts.geom.Geometry;

import java.util.Iterator;

/**

 * Fuse spatially operation

 * @author <a href="mailto:nachobrodin@gmail.com">Nacho Brodin</a>

 */

public class FuseSpatiallyOperationFast3 extends GeometryOperation {

	private static Logger 			         logger    		    = LoggerFactory.getLogger(FuseSpatiallyOperationFast3.class.getName());

	private ArrayList<Element>               featureList        = null; 

	private String                           nameIdField        = null;

	private FeatureStore                     outFeatStoreTable  = null;

	private NodeTree                         baseTree           = null;

	class Element {

		public int                 id              = -1;

		public Feature             feat            = null;

		public List<Element>       overlapList     = new ArrayList<Element>();

		public boolean             insertedToJoin  = false;

		public Geometry            jtsGeom         = null;

	}

	class NodeTree {

		public Element       element     = null;

		public int           pos         = 0;

		public NodeTree       parent      = null;

		public NodeTree(Element node, NodeTree parent) {

			this.element = node;

			this.parent = parent;

		}

		public Element getNext() {

			if(pos < element.overlapList.size())

				return element.overlapList.get(pos++);

			return null;

		}

	}

	public FuseSpatiallyOperationFast3(AbstractSextanteGeoProcess process) {

		super(process);

		featureList = new ArrayList<Element>();

	}

	@Override

	public EditableFeature invoke(org.gvsig.fmap.geom.Geometry g,

			Feature featureInput) {

		// TODO Auto-generated method stub

		return null;

	}

	@Override

	public void invoke(org.gvsig.fmap.geom.Geometry g,

			EditableFeature featureInput) {

		// TODO Auto-generated method stub

	}

	/**

	 * Computes a complete operation over the input FeatureStore. The result of this operation

	 * is stored in the output FeatureStore. This method will call once for each geometry.

	 * @param inFeatStore

	 *        Input FeatureStore

	 * @param outFeatStore

	 *        Output FeatureStore

	 * @param attrNames

	 *        List of attributes to build the output feature store

	 * @param selectedGeom

	 *        If it is true only the selected geometries will be processed

	 * @throws DataException

	 */

	@SuppressWarnings("deprecation")

	public void computesGeometryOperation(FeatureStore inFeatStore,

									FeatureStore outFeatStore,

									FeatureStore outFeatStoreTable,

									String[] attrNames,

									String[] attrNamesTable,

									boolean selectedGeomInput,

									boolean selectedGeomOutput,

									String idField) throws DataException {

		this.outFeatStoreTable = outFeatStoreTable;

		this.nameIdField = idField;

		this.inFeatureStore = inFeatStore;

		this.selectedGeomInput = selectedGeomInput;

		this.selectedGeomOverlay = selectedGeomOutput;

		FeatureSet featuresSet = null;

		featuresSet = inFeatStore.getFeatureSet();

		setFeatureStore(outFeatStore, attrNames);

		Iterator it = null;

		if(selectedGeomInput) {

            FeatureSelection ds = inFeatStore.getFeatureSelection();

            it = ds.iterator();

            numberOfFeatures = (int) ds.getSelectedCount();

		} else {

			it = featuresSet.iterator();

			numberOfFeatures = (int)featuresSet.getSize();

		}

        if (status != null) 

            status.setRangeOfValues(0, numberOfFeatures);

        if(process != null) 

            process.setProgress(0, numberOfFeatures);

        //Crear lista de elementos

		int iCount = 0;

		while( it.hasNext() && !process.getTaskMonitor().isCanceled()) {

			Feature feat = (Feature)it.next();

			Element el = new Element();

			el.feat = feat;

			el.id = iCount;

			featureList.add(el);

            if (status != null && process != null) 

                status.setCurValue(iCount);

            if(process != null) 

                process.setProgress(iCount, numberOfFeatures);

			iCount ++;

		}

//		it.dispose();

		//Crear listas de solapes para cada feature

		iCount = 0;

		while (iCount < featureList.size() && !process.getTaskMonitor().isCanceled()) {

			Element elem1 = featureList.get(iCount);

			org.gvsig.fmap.geom.Geometry geom1 = elem1.feat.getDefaultGeometry();

			if (status != null)  

                status.setCurValue(iCount);

            if(process != null)

                process.setProgress(iCount, numberOfFeatures);

			for (int i = iCount + 1; i < featureList.size(); i++) {

				Element elem2 = featureList.get(i);

				org.gvsig.fmap.geom.Geometry geom2 = elem2.feat.getDefaultGeometry();

				if(areBBoxesOverlaping(geom1, geom2)) {

					if(elem1.jtsGeom == null)

						elem1.jtsGeom = GeometryUtil.geomToJTS(geom1);

					elem2.jtsGeom = GeometryUtil.geomToJTS(geom2);

					if(elem1.jtsGeom.intersects(elem2.jtsGeom))	{

						elem1.overlapList.add(elem2);

						elem2.overlapList.add(elem1);

					}

				}

			}

			iCount ++;

		}

		iCount = 0;

		int iFeat = 0;

		while (iCount < featureList.size() && !process.getTaskMonitor().isCanceled()) {

			Element elem1 = featureList.get(iCount);

			if (status != null) 

                status.setCurValue(iCount);

            if(process != null) 

                process.setProgress(iCount, numberOfFeatures);

			if(!elem1.insertedToJoin) {

				buildListToJoin(elem1, iFeat);

				iFeat ++;

			}

			iCount ++;

		}

		if(persister != null)

			persister.end();

	}

	private boolean areBBoxesOverlaping(org.gvsig.fmap.geom.Geometry g1, org.gvsig.fmap.geom.Geometry g2) {

		if(g1.getEnvelope().getMaximum(0) < g2.getEnvelope().getMinimum(0))

			return false;

		if(g1.getEnvelope().getMinimum(0) > g2.getEnvelope().getMaximum(0))

			return false;

		if(g1.getEnvelope().getMaximum(1) < g2.getEnvelope().getMinimum(1))

			return false;

		if(g1.getEnvelope().getMinimum(1) > g2.getEnvelope().getMaximum(1))

			return false;

		return true;

	}

	/**

	 * Computes the union of the list of geometries

	 * @param listResult

	 * @param elem1

	 * @return

	 */

	private Geometry computesUnion(List<Geometry> listResult, Element elem1) {

		int splitValue = 500;

		Geometry newGeom = null;

		if(listResult.size() > splitValue) {

			List<List<Geometry>> list = splitList(listResult, splitValue);

			List<Geometry> result = new ArrayList<Geometry>();

			for (int i = 0; i < list.size(); i++) {

				Geometry aux = GeometryUtil.geometryUnion(list.get(i), elem1.feat.getDefaultGeometry().getGeometryType().getType());

				result.add(aux);

			}

			for (int i = 0; i < result.size(); i++) {

				newGeom = GeometryUtil.geometryUnion(result, elem1.feat.getDefaultGeometry().getGeometryType().getType());

			}

		} else {

			newGeom = GeometryUtil.geometryUnion(listResult, elem1.feat.getDefaultGeometry().getGeometryType().getType());	

		}

		return newGeom;

	}

	private Geometry computesUnion2(List<Geometry> listResult, Element elem1) {

		Geometry newGeom = null;

		for (int i = 1; i < listResult.size(); i++) {

			if(i == 1)

				newGeom = JTSFacade.union(listResult.get(0), listResult.get(1));

			else

				newGeom = JTSFacade.union(newGeom, listResult.get(i));

		}

		return newGeom;

	}

	private Geometry computesUnion3(List<Geometry> listResult) {

		Geometry newGeom = null;

		int iCount = 0;

		int max = listResult.size();

		if(process != null)

			process.setName("Generating union");

		while(listResult.size() > 1) {

			List<Geometry> list = new ArrayList<Geometry>();

			if (status != null)  

                status.setCurValue(iCount);

            if(process != null)

                process.setProgress(iCount, max);

			for (int i = 0; i < listResult.size(); i = i + 2) {

				if(i == (listResult.size() - 1))

					list.add(listResult.get(i));

				else {

					newGeom = JTSFacade.union(listResult.get(i), listResult.get(i + 1));

					list.add(newGeom);

				}

			}

			listResult = list;

		}

		return newGeom;

	}

	/**

	 * Splits the array of geometries to compute its union because JTS cannot support

	 * a lot of geometries

	 * @param list

	 * @param n

	 * @return

	 */

	private List<List<Geometry>> splitList(List<Geometry> list, int n) {

		int elements = (int)(list.size() / n);

		List<List<Geometry>> l = new ArrayList<List<Geometry>>();

		for (int i = 0; i < elements; i++) {

			l.add(list.subList((i * n), (i * n) + n));

		}

		if(elements * n < list.size()) {

			l.add(list.subList((elements * n), list.size()));

		}

		return l;

	}

	/**

	 * Builds the union of all lists 

	 * @param listResult

	 * @param listToJoin

	 */

	private void buildListToJoin(Element elem, int iFeat) {

		Geometry newGeom = null;

		if(elem.overlapList.size() == 0) {

			if(!elem.insertedToJoin)

				elem.insertedToJoin = true;

			newGeom = elem.jtsGeom;

		} else {

			List<Geometry> listResult = new ArrayList<Geometry>();

			NodeTree subtree = new NodeTree(elem, null);

			//Hacemos un recorrido en profundidad del ?rbol para a?adir

			//todos los elementos a la lista de geometrias a unir sin

			//repetir ninguna.

			while (subtree != null) {

				if(!subtree.element.insertedToJoin) {

					listResult.add(subtree.element.jtsGeom);

					subtree.element.insertedToJoin = true;

				}

				boolean back = false;

				Element l = subtree.getNext();

				if(l == null) 

					back = true;

				while(!back && l.insertedToJoin) {

					l = subtree.getNext();

					if(l == null) 

						back = true;

				}

				if(back) {

					subtree = subtree.parent;

					continue;

				}

				subtree = new NodeTree(l, subtree);

			}

			newGeom = computesUnion3(listResult);

		}

		try {

			insertInTable(outFeatStoreTable, elem.feat, iFeat);

			addFeatureToOutput(newGeom, elem.feat, iFeat);

		} catch (DataException e) {

			logger.info("Imposible insertar en la tabla", e);

		} catch (CreateGeometryException e) {

			logger.info("Error a?adiendo geometr?a", e);

		}

	}

	/**

	 * Adds a feature to the output

	 * @param newGeom

	 * @param feat

	 * @param newFeatID

	 * @throws DataException

	 * @throws CreateGeometryException

	 */

	private void addFeatureToOutput(Geometry newGeom, 

			Feature feat, 

			int newFeatID) throws DataException, CreateGeometryException {

		//Si hay una tabla aparte esta capa solo lleva el id como referencia a la tabla de campos

		if(outFeatStoreTable != null) { 

			lastEditFeature = persister.addFeature(newGeom, nameIdField, newFeatID);

		} else {

			//Si no hay tabla se ponen todos los campos de la tabla de entrada

			String[] fieldNames = persister.getFieldNamesWithoutGeom();

			ArrayList<String> fields = new ArrayList<String>();

			ArrayList<Object> values = new ArrayList<Object>();

			fields.add(nameIdField);

			values.add(newFeatID);

			for (int j = 0; j < fieldNames.length; j++) {

				Object obj = feat.get(fieldNames[j]);

				if(obj != null && fieldNames[j].compareTo(nameIdField) != 0) {

					fields.add(fieldNames[j]);

					values.add(obj);

				}

			}

			lastEditFeature = persister.addFeature(newGeom, fields, values);

		}

	}

	/**

	 * Insert in the output table a new feature with the fields of the input feature. Moreover 

	 * exists a field that is an identifier which is a reference to the fusion layer.

	 * @param outFeatureStoreTable

	 * @param f

	 * @throws DataException

	 */

	private void insertInTable(FeatureStore outFeatureStoreTable, Feature f, int reference) throws DataException {

		if(outFeatureStoreTable == null)

			return;

		EditableFeature edFeat = outFeatureStoreTable.createNewFeature();

		edFeat.set(nameIdField, reference);

		FeatureAttributeDescriptor[] attrList = f.getType().getAttributeDescriptors();

		for (int j = 0; j < attrList.length; j++) {

			if(attrList[j].getName().compareTo("GEOMETRY") != 0) {

				edFeat.set(attrList[j].getName(), f.get(attrList[j].getName()));

			}

		}

		outFeatureStoreTable.insert(edFeat);

	}

}

/**

 * gvSIG. Desktop Geographic Information System.

 *

 * Copyright (C) 2007-2012 gvSIG Association.

 *

 * This program is free software; you can redistribute it and/or

 * modify it under the terms of the GNU General Public License

 * as published by the Free Software Foundation; either version 2

 * of the License, or (at your option) any later version.

 *

 * This program is distributed in the hope that it will be useful,

 * but WITHOUT ANY WARRANTY; without even the implied warranty of

 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the

 * GNU General Public License for more details.

 *

 * You should have received a copy of the GNU General Public License

 * along with this program; if not, write to the Free Software

 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,

 * MA  02110-1301, USA.

 *

 * For any additional information, do not hesitate to contact us

 * at info AT gvsig.com, or visit our website www.gvsig.com.

 */

package org.gvsig.geoprocess.algorithm.fusespatially;

import org.gvsig.geoprocess.algorithm.base.core.AlgorithmAbstractLibrary;

import org.gvsig.i18n.Messages;

import org.gvsig.tools.library.LibraryException;

/**

 * Initialization of FuseSpatiallyLibrary library.

 * 

 * @author <a href="mailto:nachobrodin@gmail.com">Nacho Brodin</a>

 */

public class FuseSpatiallyLibrary extends AlgorithmAbstractLibrary {

    @Override

    protected void doInitialize() throws LibraryException {

    }

    @Override

    protected void doPostInitialize() throws LibraryException {

        Messages.addResourceFamily(

            "org.gvsig.geoprocess.algorithm.fusespatially.fusespatially",

            FuseSpatiallyLibrary.class.getClassLoader(), FuseSpatiallyLibrary.class

                .getClass().getName());

        registerGeoProcess(new FuseSpatiallyAlgorithm());

    }

}