| gvSIG desktop 1

/*

 * Created on 01-mar-2006

 *

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

 *

 * Copyright (C) 2004 IVER T.I. and 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.

 *

 * For more information, contact:

 *

 *  Generalitat Valenciana

 *   Conselleria d'Infraestructures i Transport

 *   Av. Blasco Ib??ez, 50

 *   46010 VALENCIA

 *   SPAIN

 *

 *      +34 963862235

 *   gvsig@gva.es

 *      www.gvsig.gva.es

 *

 *    or

 *

 *   IVER T.I. S.A

 *   Salamanca 50

 *   46005 Valencia

 *   Spain

 *

 *   +34 963163400

 *   dac@iver.es

 */

/* CVS MESSAGES:

*

* $Id$

* $Log$

* Revision 1.1  2006-05-24 21:09:47  azabala

* primera version en cvs despues de refactoring orientado a crear un framework extensible de geoprocessing

*

* Revision 1.2  2006/03/07 21:01:33  azabala

* *** empty log message ***

*

* Revision 1.1  2006/03/06 19:48:39  azabala

* *** empty log message ***

*

* Revision 1.1  2006/03/05 19:59:47  azabala

* *** empty log message ***

*

*

*/

package com.iver.cit.gvsig.geoprocess.spatialjoin.fmap;

import com.iver.cit.gvsig.fmap.core.IGeometry;

import com.iver.cit.gvsig.fmap.layers.FLayer;

import com.iver.cit.gvsig.fmap.layers.layerOperations.VectorialData;

import com.iver.cit.gvsig.fmap.operations.strategies.FeatureVisitor;

import com.iver.cit.gvsig.fmap.operations.strategies.VisitException;

import com.vividsolutions.jts.geom.Geometry;

/**

 * This Visitor looks for the nearest feature of a FLayer B

 *  to a specified feature of a FLayer A.

 * @author azabala

 *

 */

public class NearestFeatureVisitor implements FeatureVisitor {

	private Geometry queryGeometry;

	private int solutionIndex = -1;

	private double shortestDist = Double.MAX_VALUE;

	public NearestFeatureVisitor(Geometry geometry){

		this.queryGeometry = geometry;

	}

	public NearestFeatureVisitor(){	

	}

	public void visit(IGeometry g, int index) throws VisitException {

		double dist = queryGeometry.distance(g.toJTSGeometry());

		if(dist < shortestDist){

			shortestDist = dist;

			solutionIndex = index;

		}//if

	}

	public int getNearestFeatureIndex(){

		return solutionIndex;

	}

	public double getShortestDist(){

		return shortestDist;

	}

	public boolean hasFoundShortest(){

		return solutionIndex != -1;

	}

	public void stop(FLayer layer) {

	}

	public boolean start(FLayer layer) {

		if (layer instanceof VectorialData) {

			return true;

		}

		return false;

	}

	public String getProcessDescription() {

		return "Looking nearest geometry for a spatial join";

	}

	public void setQueryGeometry(Geometry queryGeometry) {

		this.queryGeometry = queryGeometry;

	}

}

/*

 * Created on 01-mar-2006

 *

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

 *

 * Copyright (C) 2004 IVER T.I. and 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.

 *

 * For more information, contact:

 *

 *  Generalitat Valenciana

 *   Conselleria d'Infraestructures i Transport

 *   Av. Blasco Ib??ez, 50

 *   46010 VALENCIA

 *   SPAIN

 *

 *      +34 963862235

 *   gvsig@gva.es

 *      www.gvsig.gva.es

 *

 *    or

 *

 *   IVER T.I. S.A

 *   Salamanca 50

 *   46005 Valencia

 *   Spain

 *

 *   +34 963163400

 *   dac@iver.es

 */

/* CVS MESSAGES:

*

* $Id$

* $Log$

* Revision 1.1  2006-05-24 21:09:47  azabala

* primera version en cvs despues de refactoring orientado a crear un framework extensible de geoprocessing

*

* Revision 1.4  2006/03/15 18:34:31  azabala

* *** empty log message ***

*

* Revision 1.3  2006/03/14 18:32:46  fjp

* Cambio con LayerDefinition para que sea compatible con la definici?n de tablas tambi?n.

*

* Revision 1.2  2006/03/07 21:01:33  azabala

* *** empty log message ***

*

* Revision 1.1  2006/03/06 19:48:39  azabala

* *** empty log message ***

*

* Revision 1.1  2006/03/05 19:59:47  azabala

* *** empty log message ***

*

*

*/

package com.iver.cit.gvsig.geoprocess.spatialjoin.fmap;

import com.iver.cit.gvsig.fmap.drivers.ILayerDefinition;

import com.iver.cit.gvsig.fmap.operations.strategies.FeatureVisitor;

import com.iver.cit.gvsig.fmap.operations.strategies.Strategy;

import com.iver.cit.gvsig.geoprocess.core.fmap.FeatureProcessor;

import com.iver.cit.gvsig.geoprocess.core.fmap.GeoprocessException;

/**

 * Spatial Join is a geoprocess that tries to relate two layers

 * from its geometry field. To do that it could establish two strategies:

 * <ul>	

 *<li>

 *	Relate a geometry with the nearest geometry of the second layer

 *  (1-1 cardinality).

 * </li>

 * <li>

 *  Relate a geometry with all the geometries of second layer that verifies

 *  a spatial relationship: contained, intersects, etc (1-M cardinality).

 * </li>

 * </ul>

 * SpatialJoinVisitor is a base interface for Visitor that does the

 * process of relationship

 * @author azabala

 *

 */

public interface SpatialJoinVisitor extends FeatureVisitor {

	/**

	 * Responsability to create ILayerDefinition is of the visitor,

	 * because differents visitor will create differents layer definitions

	 * (1-1 join or 1-N join)

	 * @return

	 * @throws GeoprocessException

	 */

	public ILayerDefinition getResultLayerDefinition() throws GeoprocessException;

	public void setFeatureProcessor(FeatureProcessor processor);

	public void setCancelableStrategy(Strategy secondLyrStrategy);

	public void setOnlySecondLyrSelection(boolean onlySecondLayerSelection);

}

/*

 * Created on 01-mar-2006

 *

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

 *

 * Copyright (C) 2004 IVER T.I. and 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.

 *

 * For more information, contact:

 *

 *  Generalitat Valenciana

 *   Conselleria d'Infraestructures i Transport

 *   Av. Blasco Ib??ez, 50

 *   46010 VALENCIA

 *   SPAIN

 *

 *      +34 963862235

 *   gvsig@gva.es

 *      www.gvsig.gva.es

 *

 *    or

 *

 *   IVER T.I. S.A

 *   Salamanca 50

 *   46005 Valencia

 *   Spain

 *

 *   +34 963163400

 *   dac@iver.es

 */

/* CVS MESSAGES:

 *

 * $Id$

 * $Log$

 * Revision 1.1  2006-05-24 21:09:47  azabala

 * primera version en cvs despues de refactoring orientado a crear un framework extensible de geoprocessing

 *

 * Revision 1.4  2006/03/21 19:29:36  azabala

 * *** empty log message ***

 *

 * Revision 1.3  2006/03/14 18:32:46  fjp

 * Cambio con LayerDefinition para que sea compatible con la definici?n de tablas tambi?n.

 *

 * Revision 1.2  2006/03/07 21:01:33  azabala

 * *** empty log message ***

 *

 * Revision 1.1  2006/03/06 19:48:39  azabala

 * *** empty log message ***

 *

 * Revision 1.1  2006/03/05 19:59:47  azabala

 * *** empty log message ***

 *

 *

 */

package com.iver.cit.gvsig.geoprocess.spatialjoin.fmap;

import java.util.ArrayList;

import java.util.Iterator;

import java.util.Map;

import com.hardcode.gdbms.engine.values.Value;

import com.iver.cit.gvsig.fmap.DriverException;

import com.iver.cit.gvsig.fmap.core.IFeature;

import com.iver.cit.gvsig.fmap.core.IGeometry;

import com.iver.cit.gvsig.fmap.drivers.FieldDescription;

import com.iver.cit.gvsig.fmap.drivers.ILayerDefinition;

import com.iver.cit.gvsig.fmap.drivers.LayerDefinition;

import com.iver.cit.gvsig.fmap.drivers.SHPLayerDefinition;

import com.iver.cit.gvsig.fmap.edition.EditionException;

import com.iver.cit.gvsig.fmap.layers.FLayer;

import com.iver.cit.gvsig.fmap.layers.FLyrVect;

import com.iver.cit.gvsig.fmap.layers.SelectableDataSource;

import com.iver.cit.gvsig.fmap.operations.strategies.Strategy;

import com.iver.cit.gvsig.fmap.operations.strategies.VisitException;

import com.iver.cit.gvsig.geoprocess.core.fmap.FeatureFactory;

import com.iver.cit.gvsig.geoprocess.core.fmap.FeatureProcessor;

import com.iver.cit.gvsig.geoprocess.core.fmap.SummarizationFunction;

import com.iver.cit.gvsig.geoprocess.core.fmap.XTypes;

/**

 * This visitor implement Intersect Geometry Spatial Join.

 * 

 * It is a particular case of 1-M relationship (a feature of layer A always be

 * related to M feature of layer B)

 * 

 * @author azabala

 * 

 */

public class IntersectSpatialJoinVisitor implements SpatialJoinVisitor {

	/**

	 * Needed to create layer definition

	 */

	private FLyrVect sourceLayer;

	/**

	 * Reads data of features for the source layer

	 */

	private SelectableDataSource sourceRecordset;

	/**

	 * Recordset of this layer

	 */

	private SelectableDataSource targetRecordset;

	/**

	 * Strategy to do querys against target Layer

	 */

	private Strategy strategy;

	/**

	 * Maps for each numerical field of target layer its sumarization functions

	 */

	private Map fields_sumarizeFunc;

	/**

	 * Visitor that finds features of target layer that intersects with a given

	 * feature of source layer

	 */

	private IntersectsFinderFeatureVisitor visitor;

	/**

	 * Processes results of dissolve operations (save them in a file, or cache

	 * them in memory, etc)

	 */

	private FeatureProcessor featureProcessor;

	private LayerDefinition resultLayerDefinition;

	private boolean onlySecondLyrSelection;

	public IntersectSpatialJoinVisitor(FLyrVect sourceLayer,

										FLyrVect targetLayer,

										Map fields_sumarizeFunct, 

										FeatureProcessor processor) throws DriverException {

		this.sourceLayer = sourceLayer;

		this.sourceRecordset = sourceLayer.getRecordset();

		this.featureProcessor = processor;

		this.fields_sumarizeFunc = fields_sumarizeFunct;

		this.targetRecordset = targetLayer.getRecordset();

		this.visitor = new IntersectsFinderFeatureVisitor(fields_sumarizeFunc);

	}

	public void visit(IGeometry g, int index) throws VisitException {

		IFeature solution = null;

		visitor.setQueryGeometry(g.toJTSGeometry());

		try {

			if(onlySecondLyrSelection)

				visitor.setSelection(targetRecordset.getSelection());	

			strategy.process(visitor, g.getBounds2D());

			solution = createFeature(g, index, visitor.getNumIntersections());

			featureProcessor.processFeature(solution);

			resetFunctions();

		} catch (DriverException e) {

			throw new VisitException(

					"Error al buscar las intersecciones de una geometria durante un spatial join");

		} catch (com.hardcode.gdbms.engine.data.driver.DriverException e) {

			throw new VisitException(

			"Error al buscar las intersecciones de una geometria durante un spatial join");

		}

	}

	public String getProcessDescription() {

		return "Spatial joining by intersects criteria";

	}

	public void resetFunctions(){

		Iterator fieldsIt = fields_sumarizeFunc.keySet().iterator();

		while (fieldsIt.hasNext()) {

			String field = (String) fieldsIt.next();

			SummarizationFunction[] functions = 

				(SummarizationFunction[]) fields_sumarizeFunc.get(field);

			for (int i = 0; i < functions.length; i++) {

				functions[i].reset();

			}// for

		}// while

	}

	private IFeature createFeature(IGeometry g, int index, int numIntersections)

			throws com.hardcode.gdbms.engine.data.driver.DriverException {

		IFeature solution = null;

		int numSourceFields = this.sourceRecordset.getFieldCount();

		ArrayList values = new ArrayList();

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

			values.add(sourceRecordset.getFieldValue(index, i));

		}

		//target layer

		Iterator fieldsIt = fields_sumarizeFunc.keySet().iterator();

		while (fieldsIt.hasNext()) {

			String field = (String) fieldsIt.next();

			SummarizationFunction[] functions = 

				(SummarizationFunction[]) fields_sumarizeFunc.get(field);

			for (int i = 0; i < functions.length; i++) {

				values.add(functions[i].getSumarizeValue());

			}// for

		}// while

		//values.add(ValueFactory.createValue(numIntersections));

		Value[] attrs = new Value[values.size()];

		values.toArray(attrs);

		solution = FeatureFactory.createFeature(attrs, g);

		return solution;

	}

	public void stop(FLayer layer) {

		featureProcessor.finish();

	}

	public boolean start(FLayer layer) {

			try {

				this.featureProcessor.start();

			} catch (EditionException e) {

				return false;

			}

			return true;

	}

	public ILayerDefinition getResultLayerDefinition(){

		if(this.resultLayerDefinition == null){

			ArrayList fields = new ArrayList();

			resultLayerDefinition = new SHPLayerDefinition();

			//result layer will be exactly similar to firstLayer with

			//new attributes

			try {

				resultLayerDefinition.setShapeType(sourceLayer.getShapeType());

			} catch (DriverException e) {

				// TODO Auto-generated catch block

				e.printStackTrace();

			}

			//first layer attributes

			int numFields = 0;

			try {

				numFields = sourceRecordset.getFieldCount();

			} catch (com.hardcode.gdbms.engine.data.driver.DriverException e) {

				// TODO Auto-generated catch block

				e.printStackTrace();

			}

			FieldDescription fieldDesc = null;

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

				fieldDesc = new FieldDescription();

				try {

					fieldDesc.setFieldName(sourceRecordset.getFieldName(i));

					fieldDesc.setFieldType(sourceRecordset.getFieldType(i));

				} catch (com.hardcode.gdbms.engine.data.driver.DriverException e) {

					// TODO Auto-generated catch block

					e.printStackTrace();

				}

				fields.add(fieldDesc);

			}

			//target layer attributes

			Iterator fieldsIt = fields_sumarizeFunc.keySet().iterator();

			while(fieldsIt.hasNext()){

				String field = (String) fieldsIt.next();

				SummarizationFunction[] functions =

					(SummarizationFunction[]) fields_sumarizeFunc.get(field);

				for(int i = 0; i < functions.length; i++){

					fieldDesc = new FieldDescription();

					fieldDesc.setFieldLength(10);

					fieldDesc.setFieldDecimalCount(4);

					//to avoid truncation of field names (f.example shp)

					//we only catch three first letters

					String shortName = null;

					if(field.length() > 3)

						shortName = field.substring(0,3);

					else

						shortName = field;

					fieldDesc.setFieldName(

							shortName + "_" + functions[i].toString());

					fieldDesc.setFieldType(XTypes.DOUBLE);

					fields.add(fieldDesc);

				}//for

			}//while

			FieldDescription[] fieldsDesc = null;

			if(fields.size() == 0){

				fieldsDesc = new FieldDescription[0];

			}else{

				fieldsDesc = new FieldDescription[fields.size()];

				fields.toArray(fieldsDesc);

			}

			resultLayerDefinition.setFieldsDesc(fieldsDesc);

		}//if result == null

		return resultLayerDefinition;

	}

	public void setFeatureProcessor(FeatureProcessor processor) {

		this.featureProcessor = processor;

	}

	public void setCancelableStrategy(Strategy secondLyrStrategy) {

		this.strategy = secondLyrStrategy;

	}

	public void setOnlySecondLyrSelection(boolean onlySecondLayerSelection) {

		this.onlySecondLyrSelection = onlySecondLayerSelection;

	}

}

/*

 * Created on 25-abr-2006

 *

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

 *

 * Copyright (C) 2004 IVER T.I. and 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.

 *

 * For more information, contact:

 *

 *  Generalitat Valenciana

 *   Conselleria d'Infraestructures i Transport

 *   Av. Blasco Ib??ez, 50

 *   46010 VALENCIA

 *   SPAIN

 *

 *      +34 963862235

 *   gvsig@gva.es

 *      www.gvsig.gva.es

 *

 *    or

 *

 *   IVER T.I. S.A

 *   Salamanca 50

 *   46005 Valencia

 *   Spain

 *

 *   +34 963163400

 *   dac@iver.es

 */

/* CVS MESSAGES:

*

* $Id$

* $Log$

* Revision 1.1  2006-05-24 21:09:47  azabala

* primera version en cvs despues de refactoring orientado a crear un framework extensible de geoprocessing

*

* Revision 1.1  2006/05/01 19:09:09  azabala

* Intento de optimizar el spatial join por vecino mas proximo (no funciona)

*

*

*/

package com.iver.cit.gvsig.geoprocess.spatialjoin.fmap;

import java.awt.geom.Rectangle2D;

import java.util.Stack;

import com.iver.cit.gvsig.fmap.DriverException;

import com.iver.cit.gvsig.fmap.core.IFeature;

import com.iver.cit.gvsig.fmap.core.IGeometry;

import com.iver.cit.gvsig.fmap.layers.FBitSet;

import com.iver.cit.gvsig.fmap.layers.FLayer;

import com.iver.cit.gvsig.fmap.layers.FLyrVect;

import com.iver.cit.gvsig.fmap.operations.strategies.FeatureVisitor;

import com.iver.cit.gvsig.fmap.operations.strategies.VisitException;

import com.iver.cit.gvsig.geoprocess.core.fmap.FeatureProcessor;

import com.vividsolutions.jts.geom.Envelope;

import com.vividsolutions.jts.geom.Geometry;

import com.vividsolutions.jts.geom.GeometryFactory;

import com.vividsolutions.jts.operation.distance.DistanceOp;

/**

 * This visitor does nearest feature spatial join by applying an heuristic

 * strategy (in constract with NearestSpatialJoinVisitor, that does a

 * secuential scanning).

 * <br>

 * Which heuristic does this visitor apply?

 * It obtains second layer (target layer in spatial join) full extent,

 * and subdivide it in 4 envelopes. After that, it computes the distance

 * of the geometry we want to join with second layer, and computes

 * 4 distances with each one of the envelopes. Then, it recursively subdivide

 * the Envelope at the shortest distance.

 * <br>

 * This process is repeated recursively until we obtain a nearest envelope

 * of a parametrized dimension. After that, it makes a spatial query with

 * this envelope on the layer B. If this query doesnt return, repeat the

 * spatial query with the envelope that originated this envelope (we take

 * the parent node in the quad-tree structure).

 * <br>

 * A critical aspect is optimization of the number of levels of quad-tree.

 * 

 * If we take very few levels, the spatial query will return a lot of

 * candidates to nearest, so we wont get advantage of this stuff.

 *  

 * If we take a lot of levels, we wont get result in the spatial queries,

 * and we'll have to do a lot of querys.

 * 

 * @author azabala

 * 

 * FIXME EL ALGORITMO FALLA!!!!!!!! EL QUADTREE ES UNA ESTRUCTURA

 * BUENA PARA RECTANGULOS, PERO PARA PUNTOS CREO QUE NO FUNCIONA.

 * NO TIENE EN CUENTA LOS EXTREMOS DE LOS RECTANGULOS

 *

 */

public class NearestHeuristicSpatialJoinVisitor extends NearestSpatialJoinVisitor {

	private QuadTreeUtil quadTree = new QuadTreeUtil();

	/**

	 * Full extent of the layer where we are looking for

	 * features to join by spatial criteria

	 */

	private Envelope targetLayerEnv = null;

	/**

	 * 

	 * @param sourceLayer

	 * @param targetLayer

	 * @param processor

	 * @throws DriverException

	 */

	public NearestHeuristicSpatialJoinVisitor(FLyrVect sourceLayer, 

			FLyrVect targetLayer, 

			FeatureProcessor processor) throws DriverException {

		super(sourceLayer, targetLayer, processor);

		Rectangle2D rect = targetLayer.getFullExtent();

		targetLayerEnv = new Envelope(rect.getMinX(), 

				rect.getMaxX(),

				rect.getMinY(),

				rect.getMaxY());

	}

	//	TODO If we need a class to look for nearest feature to a given

	//feature, move to a public class

	class LookForNearest implements FeatureVisitor{

		/**

		 * Index of the nearest processed feature to the given geometry

		 */

		int nearestFeatureIndex = -1;

		/**

		 * min distance of the features processed in the search of

		 * nearest feature

		 */

		double minDistance = Double.MAX_VALUE;

		/**

		 * Geometry whose nearest feature we want to locate

		 */

		Geometry firstG;

		/**

		 * It this selectin is != null, in our search we will only

		 * consideer features selected.

		 */

		FBitSet selection;

		public boolean hasFoundShortest(){

			return nearestFeatureIndex != -1;

		}

		public int getNearestFeatureIndex(){

			return nearestFeatureIndex;

		}

		public void setSelection(FBitSet bitSet){

			this.selection = bitSet;

		}

		public void setGeometry(Geometry firstG){

			this.firstG = firstG;

		}

		public void visit(IGeometry g, int index) throws VisitException {

			if(selection != null){

				if(! selection.get(index)){

					return;

				}

			}

			double dist = firstG.distance(g.toJTSGeometry());

			if(dist < minDistance){

				minDistance = dist;

				nearestFeatureIndex = index;

			}//if

		}

		public String getProcessDescription() {

			return "";

		}

		public void stop(FLayer layer) {

		}

		public boolean start(FLayer layer) {

			return true;

		}

	};

	/**

	 * Processes a Feature of source layer, looking for its nearest feature of

	 * target layer and taking attributes from it

	 */

	public void visit(IGeometry g, int sourceIndex) throws VisitException {

		final Geometry geometry = g.toJTSGeometry();	

		Stack stackOfEnvelopes = quadTree.getNearestEnvelopeOfIdealDimension(geometry,

				targetLayerEnv);

		LookForNearest visitor = new LookForNearest();

		visitor.setGeometry(geometry);

		while((stackOfEnvelopes.size() > 0) ) {

			Envelope envelope = (Envelope) stackOfEnvelopes.pop();

			Rectangle2D.Double rect = new Rectangle2D.Double(envelope.getMinX(), 

					envelope.getMinY(),

					envelope.getWidth(),

					envelope.getHeight());

			try {

				if(onlySecondLayerSelection){

					visitor.setSelection(targetRecordset.getSelection());

				}

				strategy.process(visitor, rect);

				if(visitor.hasFoundShortest()){

					int targetIndex = visitor.getNearestFeatureIndex();

					IFeature joinedFeature = createFeature(g, 

														sourceIndex, 

														targetIndex);

					this.featureProcessor.processFeature(joinedFeature);

					return;

				}

			} catch (DriverException e) {

				throw new VisitException("Error accediendo a los datos buscando el feature mas proximo", e);

			} catch (com.hardcode.gdbms.engine.data.driver.DriverException e) {

				throw new VisitException("Error accediendo a los datos buscando el feature mas proximo", e);

			} 	

		}//while

	}

	/**

	 * FIXME Refinar muy mucho, pero de momento me vale para hacer la busqueda

	 * de la geometria mas proxima a una dada mediante subdivisi?n del espacio.

	 *  

	 * @author azabala

	 *

	 */

	class QuadTreeUtil{

		double DEFAULT_IDEAL_DIMENSION = 500d;

		double idealDimension = DEFAULT_IDEAL_DIMENSION;

		public void setIdealDimension(double idealDimension){

			this.idealDimension = idealDimension;

		}

		public double distance(Geometry geo, Envelope rect){

			GeometryFactory geoFact = new GeometryFactory();

			Geometry poly = geoFact.toGeometry(rect);

			return DistanceOp.distance(geo, poly);

		}

		public double getMaxDimension(Envelope env){

			double w = env.getWidth();

			double h = env.getHeight();

			return (w > h ? w : h);

		}

		public Stack getNearestEnvelopeOfIdealDimension(Geometry nearest,

				Envelope originalEnvelope){

			//stack with all the hierarchical envelopes of the solution quad

			Stack solution = new Stack();

			Envelope firstsolution = originalEnvelope;

			//the last try will be the full extent

			solution.push(firstsolution);

			double maxDimension = getMaxDimension(originalEnvelope);

			while(maxDimension > idealDimension){

				Envelope[] quads = getNextQtreeLevel(firstsolution);

				double d0 = distance(nearest, quads[0]);

				double d1 = distance(nearest, quads[1]);

				double d2 = distance(nearest, quads[2]);

				double d3 = distance(nearest, quads[3]);

				if(d0 <= d1 && d0 <= d2 && d0 <= d3 )

					firstsolution = quads[0];

				else if(d1 <= d0 && d1 <= d2 && d1 <= d3)

					firstsolution = quads[1];

				else if(d2 <= d0 && d2 <= d1 && d2 <= d3)

					firstsolution = quads[2];

				else 

					firstsolution = quads[3];

				solution.push(firstsolution);

				maxDimension = getMaxDimension(firstsolution);

			}

			return solution;

		}

		public  Envelope[] getNextQtreeLevel(Envelope rect){

			Envelope[] solution = new Envelope[4];

			int SW = 0;

			int SE = 1;

			int NW = 2;

			int NE = 3;

			double xMin = rect.getMinX();

			double xMax = rect.getMaxX();

			double yMin = rect.getMinY();

			double yMax = rect.getMaxY();

			double xCenter = (xMin + xMax) / 2d;

			double yCenter = (yMin + yMax) / 2d;

			Envelope r1 = new Envelope(xMin, xCenter, yMin, yCenter);

			Envelope r2 = new Envelope(xCenter, xMax, yMin, yCenter);

			Envelope r3 = new Envelope(xMin, xCenter, yCenter, yMax);

			Envelope r4 = new Envelope(xCenter, xMax, yCenter, yMax);

			solution[SW] = r1;

			solution[SE] = r2;

			solution[NW] = r3;

			solution[NE] = r4;

			return solution;

		}

	}

}

/*

 * Created on 01-mar-2006

 *

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

 *

 * Copyright (C) 2004 IVER T.I. and 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.

 *

 * For more information, contact:

 *

 *  Generalitat Valenciana

 *   Conselleria d'Infraestructures i Transport

 *   Av. Blasco Ib??ez, 50

 *   46010 VALENCIA

 *   SPAIN

 *

 *      +34 963862235

 *   gvsig@gva.es

 *      www.gvsig.gva.es

 *

 *    or

 *

 *   IVER T.I. S.A

 *   Salamanca 50

 *   46005 Valencia

 *   Spain

 *

 *   +34 963163400

 *   dac@iver.es

 */

/* CVS MESSAGES:

 *

 * $Id$

 * $Log$

 * Revision 1.1  2006-05-24 21:09:47  azabala

 * primera version en cvs despues de refactoring orientado a crear un framework extensible de geoprocessing

 *

 * Revision 1.6  2006/05/01 19:08:41  azabala

 * documentacion, y algunos metodos pasados de private a "friendly" -sin modificador-

 *

 * Revision 1.5  2006/03/21 19:29:36  azabala

 * *** empty log message ***

 *

 * Revision 1.4  2006/03/15 18:34:31  azabala

 * *** empty log message ***

 *

 * Revision 1.3  2006/03/14 18:32:46  fjp

 * Cambio con LayerDefinition para que sea compatible con la definici?n de tablas tambi?n.

 *

 * Revision 1.2  2006/03/07 21:01:33  azabala

 * *** empty log message ***

 *

 * Revision 1.1  2006/03/06 19:48:39  azabala

 * *** empty log message ***

 *

 * Revision 1.1  2006/03/05 19:59:47  azabala

 * *** empty log message ***

 *

 *

 */

package com.iver.cit.gvsig.geoprocess.spatialjoin.fmap;

import com.hardcode.gdbms.engine.values.Value;

import com.iver.cit.gvsig.fmap.DriverException;

import com.iver.cit.gvsig.fmap.core.IFeature;

import com.iver.cit.gvsig.fmap.core.IGeometry;

import com.iver.cit.gvsig.fmap.drivers.ILayerDefinition;

import com.iver.cit.gvsig.fmap.edition.EditionException;

import com.iver.cit.gvsig.fmap.layers.FLayer;

import com.iver.cit.gvsig.fmap.layers.FLyrVect;

import com.iver.cit.gvsig.fmap.layers.SelectableDataSource;

import com.iver.cit.gvsig.fmap.operations.strategies.Strategy;

import com.iver.cit.gvsig.fmap.operations.strategies.VisitException;

import com.iver.cit.gvsig.geoprocess.core.fmap.DefinitionUtils;

import com.iver.cit.gvsig.geoprocess.core.fmap.FeatureFactory;

import com.iver.cit.gvsig.geoprocess.core.fmap.FeatureProcessor;

import com.iver.cit.gvsig.geoprocess.core.fmap.GeoprocessException;

/**

 * This visitor implement Nearest Geometry Spatial Join.

 * 

 * It is a particular case of 1-1 relationship

 * (a feature of layer A always be related to a feature of layer B)

 * 

 * If two features of layer B are at the same distance of a feature of layer A,

 * we will took the first one analized.

 * 

 * In this visitor we apply a secuential scaning strategy: given a geometry 

 * of layer A, we check distances with all geometries of layer B return

 * the geometry at the min distance.

 * 

 * 

 * @author azabala

 *

 */

public class NearestSpatialJoinVisitor implements SpatialJoinVisitor {

	/**

	 * Needed to create layer definition

	 */

	 FLyrVect sourceLayer;

	/**

	 * Reads data of features for the source layer

	 */

	 SelectableDataSource sourceRecordset;

	/**

	 * Reads data of features for the target layer

	 */

	FLyrVect targetLayer;

	/**

	 * Recordset of this layer

	 */

	SelectableDataSource targetRecordset;

	/**

	 * Strategy to do querys against target Layer

	 */

	Strategy strategy;

	/**

	 * Processes results of dissolve operations (save them in a file, or cache

	 * them in memory, etc)

	 */

	FeatureProcessor featureProcessor;

	/**

	 * It looks for nearest feature to a given feature

	 */

	private NearestFeatureVisitor lookForNearestVisitor;

	/**

	 * Schema of the result layer

	 */

	ILayerDefinition layerDefinition;

	/**

	 * flag to process only selections of second layer

	 */

	boolean onlySecondLayerSelection;

	/**

	 * Constructor. It receives layer with which we want to do a spatial join

	 * 

	 * @param targetRecordset

	 * @throws DriverException 

	 */

	public NearestSpatialJoinVisitor(FLyrVect sourceLayer,

			FLyrVect targetLayer,

			FeatureProcessor processor) throws DriverException {

		this.sourceLayer = sourceLayer;

		this.sourceRecordset = sourceLayer.getRecordset();

		this.targetLayer = targetLayer;

		this.targetRecordset = targetLayer.getRecordset();

		this.featureProcessor = processor;

		this.lookForNearestVisitor = new NearestFeatureVisitor();

	}

	/**

	 * Processes a Feature of source layer, looking for its nearest feature of

	 * target layer and taking attributes from it

	 */

	public void visit(IGeometry g, int sourceIndex) throws VisitException {

		lookForNearestVisitor.setQueryGeometry(g.toJTSGeometry());

		try {

			if(onlySecondLayerSelection)

				strategy.process(lookForNearestVisitor, targetRecordset.getSelection());

			else

				strategy.process(lookForNearestVisitor);

			int targetIndex = lookForNearestVisitor.getNearestFeatureIndex();

			IFeature joinedFeature = createFeature(g, sourceIndex, targetIndex);

			this.featureProcessor.processFeature(joinedFeature);

		} catch (DriverException e) {

			throw new VisitException(

					"Problemas accediendo a los datos durante un nearest spatial join");

		} catch (com.hardcode.gdbms.engine.data.driver.DriverException e) {

			throw new VisitException(

			"Problemas accediendo a los datos durante un nearest spatial join");

		}

	}

	public void stop(FLayer layer) {

		this.featureProcessor.finish();

	}

	public boolean start(FLayer layer) {

		try {

			this.featureProcessor.start();

		} catch (EditionException e) {

			return false;

		}

		return true;

	}

	public String getProcessDescription() {

		return "Spatial joining by nearest criteria";

	}

	IFeature createFeature(IGeometry g, int sourceLayerIndex, int targetLayerIndex) throws DriverException, com.hardcode.gdbms.engine.data.driver.DriverException {

		IFeature solution = null;

		int numFieldsA = sourceRecordset.getFieldCount();

		int numFieldsB = targetRecordset.getFieldCount();

		Value[] featureAttr = new Value[numFieldsA + numFieldsB];

		for (int indexField = 0; indexField < numFieldsA; indexField++) {

			featureAttr[indexField] = sourceRecordset

				.getFieldValue(sourceLayerIndex,indexField);

		}

		for (int indexFieldB = 0; indexFieldB < numFieldsB; indexFieldB++) {

			featureAttr[numFieldsA + indexFieldB] = 

				targetRecordset.getFieldValue(targetLayerIndex, indexFieldB);

		}

		solution = FeatureFactory.createFeature(featureAttr, g);

		return solution;

	}

	public ILayerDefinition getResultLayerDefinition() throws GeoprocessException{

		if(layerDefinition == null){

			try {

				layerDefinition = DefinitionUtils.

				mergeLayerDefinitions(sourceLayer, targetLayer);

			} catch (Exception e) {

				throw new GeoprocessException("Problemas al crear el esquema de la capa solucion de un spatial join");

			} 

		}

		return layerDefinition;

	}

	public void setFeatureProcessor(FeatureProcessor processor) {

		this.featureProcessor = processor;

	}

	public void setCancelableStrategy(Strategy secondLyrStrategy) {

		this.strategy = secondLyrStrategy;

	}

	public void setOnlySecondLyrSelection(boolean onlySecondLayerSelection) {

		this.onlySecondLayerSelection = onlySecondLayerSelection;

	}

}

/*

 * Created on 02-may-2006

 *

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

 *

 * Copyright (C) 2004 IVER T.I. and 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.

 *

 * For more information, contact:

 *

 *  Generalitat Valenciana

 *   Conselleria d'Infraestructures i Transport

 *   Av. Blasco Ib??ez, 50

 *   46010 VALENCIA

 *   SPAIN

 *

 *      +34 963862235

 *   gvsig@gva.es

 *      www.gvsig.gva.es

 *

 *    or

 *

 *   IVER T.I. S.A

 *   Salamanca 50

 *   46005 Valencia

 *   Spain

 *

 *   +34 963163400

 *   dac@iver.es

 */

/* CVS MESSAGES:

*

* $Id$

* $Log$

* Revision 1.1  2006-05-24 21:09:47  azabala

* primera version en cvs despues de refactoring orientado a crear un framework extensible de geoprocessing

*

* Revision 1.1  2006/05/02 18:58:47  azabala

* first version in cvs

*

*

*/

package com.iver.cit.gvsig.geoprocess.spatialjoin.fmap;

import java.awt.geom.Rectangle2D;

import java.util.List;

import com.iver.cit.gvsig.fmap.DriverException;

import com.iver.cit.gvsig.fmap.core.IFeature;

import com.iver.cit.gvsig.fmap.core.IGeometry;

import com.iver.cit.gvsig.fmap.drivers.DriverIOException;

import com.iver.cit.gvsig.fmap.layers.FLyrVect;

import com.iver.cit.gvsig.fmap.layers.ReadableVectorial;

import com.iver.cit.gvsig.fmap.operations.strategies.VisitException;

import com.iver.cit.gvsig.fmap.spatialindex.INearestNeighbourFinder;

import com.iver.cit.gvsig.fmap.spatialindex.ISpatialIndex;

import com.iver.cit.gvsig.geoprocess.core.fmap.FeatureProcessor;

import com.vividsolutions.jts.geom.Geometry;

/**

 * This  visitor does spatial join with nearest neighbour 

 * criteria by using an spatial index with nearest neighbour

 * searching capabilities.<br>

 * By now, RTreeSptLib is the only spatial index that is also

 * a INearestNeigbourFinder implementation.

 * <br>

 * @author azabala

 *

 */

public class SpatiallyIndexedSpatialJoinVisitor extends

		NearestSpatialJoinVisitor {

	/**

	 * Geometry.distance() is a costly operation. Thats the reason

	 * for we are only using a nearest neighbour.

	 * TODO SpatialIndex works with Rectangle2D, and this may be a simplification

	 * that drives to errors. Make aditional probes to use a number of default

	 * neighbours

	 */

	static final int DEFAULT_NUM_NEIGBOURS = 1;

	/**

	 * Number of neighbours that nearestFinder must

	 * found.

	 */

	int numOfNeighbours = DEFAULT_NUM_NEIGBOURS;

	/**

	 * Spetialized instance in nearest neighbour searchs.

	 */

	private INearestNeighbourFinder nearestFinder;

	/**

	 * Constructor

	 * @param sourceLayer

	 * @param targetLayer

	 * @param processor

	 * @throws DriverException

	 */

	public SpatiallyIndexedSpatialJoinVisitor(FLyrVect sourceLayer, 

			FLyrVect targetLayer, 

			FeatureProcessor processor) throws DriverException {

		super(sourceLayer, targetLayer, processor);

		initialize();

	}

	void initialize(){

		ISpatialIndex spatialIndex =

			targetLayer.getISpatialIndex();

		if(spatialIndex instanceof INearestNeighbourFinder)

			nearestFinder = (INearestNeighbourFinder)spatialIndex;

		else

			throw new IllegalArgumentException("La segunda capa de spatial join ha de tener un ?ndice espacial de tipo RTreeSptLib para usar este visitor");

	}

	/**

	 * Processes a Feature of source layer, looking for its nearest feature of

	 * target layer and taking attributes from it

	 */

	public void visit(IGeometry g, int sourceIndex) throws VisitException {

		try {

		//no se si el rtree har? la busqueda bien si el rectangulo

		//de busqueda no est? insertado. Hacer las pruebas (si no,

		//a?adimos ahora y borramos luego)

		Geometry gJts = g.toJTSGeometry();

		Rectangle2D rect = g.getBounds2D();	

		List nearestLst = nearestFinder.

			findNNearest(numOfNeighbours, rect);

		int targetIndex = -1;//index of nearest neighbour

		double nearestDistance = Double.MAX_VALUE;

		ReadableVectorial rv = targetLayer.getSource();

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

			int index2 = ((Integer)nearestLst.get(i)).intValue();

			IGeometry g2 = rv.getShape(index2);

			Geometry g2Jts = g2.toJTSGeometry();

			double dist = gJts.distance(g2Jts);

			if(dist <= nearestDistance){

				//by adding <=, we follow the convention that

				//if two features are at the same distance, take

				//the last as nearest neighbour

				nearestDistance = dist;

				targetIndex = index2;

			}//if

		}//for

		if(targetIndex == -1)

			throw new VisitException("Problemas durante el spatial join, no se encontr? un vecino mas proximo");

		IFeature joinedFeature;

			joinedFeature = createFeature(g, sourceIndex, targetIndex);

			this.featureProcessor.processFeature(joinedFeature);

		} catch (DriverException e) {

			throw new VisitException("Error de driver al escribir un feature resultante de un spatial join", e);

		} catch (com.hardcode.gdbms.engine.data.driver.DriverException e) {

			throw new VisitException("Error de driver al escribir un feature resultante de un spatial join", e);

		} catch (DriverIOException e) {

			throw new VisitException("Error accediendo a datos de la capa destino en spatial join", e);

		}

	}

}

/*

 * Created on 01-mar-2006

 *

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

 *

 * Copyright (C) 2004 IVER T.I. and 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.

 *

 * For more information, contact:

 *

 *  Generalitat Valenciana

 *   Conselleria d'Infraestructures i Transport

 *   Av. Blasco Ib??ez, 50

 *   46010 VALENCIA

 *   SPAIN

 *

 *      +34 963862235

 *   gvsig@gva.es

 *      www.gvsig.gva.es

 *

 *    or

 *

 *   IVER T.I. S.A

 *   Salamanca 50

 *   46005 Valencia

 *   Spain

 *

 *   +34 963163400

 *   dac@iver.es

 */

/* CVS MESSAGES:

 *

 * $Id$

 * $Log$

 * Revision 1.1  2006-05-24 21:09:47  azabala

 * primera version en cvs despues de refactoring orientado a crear un framework extensible de geoprocessing

 *

 * Revision 1.2  2006/03/07 21:01:33  azabala

 * *** empty log message ***

 *

 * Revision 1.1  2006/03/06 19:48:39  azabala

 * *** empty log message ***

 *

 * Revision 1.1  2006/03/05 19:59:47  azabala

 * *** empty log message ***

 *

 *

 */

package com.iver.cit.gvsig.geoprocess.spatialjoin.fmap;

import java.util.ArrayList;

import java.util.Iterator;

import java.util.List;

import java.util.Map;

import com.hardcode.gdbms.engine.data.driver.DriverException;

import com.hardcode.gdbms.engine.values.NumericValue;

import com.hardcode.gdbms.engine.values.Value;

import com.iver.cit.gvsig.fmap.core.IGeometry;

import com.iver.cit.gvsig.fmap.layers.FBitSet;

import com.iver.cit.gvsig.fmap.layers.FLayer;

import com.iver.cit.gvsig.fmap.layers.SelectableDataSource;

import com.iver.cit.gvsig.fmap.layers.layerOperations.AlphanumericData;

import com.iver.cit.gvsig.fmap.layers.layerOperations.VectorialData;

import com.iver.cit.gvsig.fmap.operations.strategies.FeatureVisitor;

import com.iver.cit.gvsig.fmap.operations.strategies.VisitException;

import com.iver.cit.gvsig.geoprocess.core.fmap.SummarizationFunction;

import com.vividsolutions.jts.geom.Geometry;

/**

 * Given a feature of JOIN source layer,

 *  it looks for intersecting geometries of JOIN target layer and applies

 *  a sumarization function to its numeric fields.

 *  

 * @author azabala

 *

 */

public class IntersectsFinderFeatureVisitor implements FeatureVisitor {

	/**

	 * Reads atributes of target layer

	 */

	SelectableDataSource targetRecordset;

	/**

	 * Geometry of layer A whose intersections of layer B

	 * we are looking for

	 */

	private Geometry queryGeometry;

	/**

	 * It has indexes of intersections

	 */

	private List intersectIndexes = null;

	/**

	 * Relates a set of sumarization functions with a numeric field

	 * name

	 */

	Map fields_sumarizationFun = null;

	private FBitSet selection;

	public IntersectsFinderFeatureVisitor(Geometry geometry, Map functions) {

		this.queryGeometry = geometry;

		this.fields_sumarizationFun = functions;

		intersectIndexes = new ArrayList();

	}

	public IntersectsFinderFeatureVisitor(Map functions) {

		this.fields_sumarizationFun = functions;

		intersectIndexes = new ArrayList();

	}

	public void visit(IGeometry g, int index) throws VisitException {

		if(selection != null){

			if(! selection.get(index)){

				//dont process feature because is not selected