| gvSIG desktop 1

/*

 * Created on 10-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: 

 */

package org.gvsig.jts.voronoi;

import java.awt.geom.Point2D;

import java.rmi.server.UID;

import java.util.ArrayList;

import java.util.Iterator;

import java.util.LinkedList;

import java.util.List;

import org.gvsig.exceptions.BaseException;

import org.gvsig.fmap.core.NewFConverter;

import org.gvsig.jts.JtsUtil;

import org.gvsig.jts.voronoi.Voronoier.VoronoiStrategy;

import org.gvsig.jts.voronoi.dt.IncrementalDT;

import org.gvsig.jts.voronoi.dt.TriangleDT;

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

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

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

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

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

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

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

import com.iver.utiles.swing.threads.CancellableProgressTask;

import com.vividsolutions.jts.geom.Coordinate;

import com.vividsolutions.jts.geom.Geometry;

import com.vividsolutions.jts.geom.LineString;

public class IncrementalTinVoronoiStrategy implements VoronoiStrategy {

        public List<IFeature> createThiessenPolygons(

                        VoronoiAndTinInputLyr inputLyr,

                        boolean onlySelection,

                        CancellableProgressTask progressMonitor) throws BaseException {

                IncrementalDT triangulator = new IncrementalDT();

                int numberOfPoints = inputLyr.getSource().getShapeCount();

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

                        if(onlySelection){

                                if(! inputLyr.getRecordset().getSelection().get(i))

                                        continue;

                        }

                        Point2D point = inputLyr.getPoint(i);

                        Coordinate coord = new Coordinate(point.getX(), point.getY());

                        triangulator.insertPoint(coord);

                }

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

                LinkedList triangles = triangulator.triangles.getLinkedList();

                Iterator trianglesIterator = triangles.iterator();

                while (trianglesIterator.hasNext()) {

                        TriangleDT t = (TriangleDT) trianglesIterator.next();

                        Coordinate first = new Coordinate(t.A.x, t.A.y);

                        Coordinate second = new Coordinate(t.B.x, t.B.y);

                        Coordinate third = new Coordinate(t.C.x, t.C.y);

                        Coordinate[] coords = new Coordinate[4];

                        coords[0] = first;

                        coords[1] = second;

                        coords[2] = third;

                        coords[3] = (Coordinate) first.clone();

                        LineString line = JtsUtil.GEOMETRY_FACTORY.createLineString(coords);

                        trianglesEdges.add(line);

                }// while

                List<Geometry> thiessenPolygons = Voronoier.getThiessenPolygons(trianglesEdges, progressMonitor);

                List<IFeature> solution = new ArrayList<IFeature>();

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

                        Geometry geometry = thiessenPolygons.get(i);

                        IGeometry polygon = NewFConverter.toFMap(geometry);

                        Value fid = ValueFactory.createValue(i);

                        Value associatedVertex = ValueFactory.createValue(i);

                        Value[] values = new Value[] { fid, associatedVertex };

                        DefaultFeature feature = new DefaultFeature(polygon, values,

                                        new UID().toString());

                        solution.add(feature);

                }

                return solution;

        }

        public List<IFeature> createThiessenPolygons(VoronoiAndTinInputLyr inputLyr, boolean onlySelection)

                        throws BaseException {

                return createThiessenPolygons(inputLyr, onlySelection, null);

        }

        public List<IFeature> createTin(VoronoiAndTinInputLyr inputLyr, boolean onlySelection)

                        throws BaseException {

                return createThiessenPolygons(inputLyr, onlySelection, null);

        }

        public List<IFeature> createTin(VoronoiAndTinInputLyr inputLyr, 

                        boolean onlySelection,

                        CancellableProgressTask progressMonitor) throws BaseException {

                List<IFeature> solution = new ArrayList<IFeature>();

                IncrementalDT triangulator = new IncrementalDT();

                int numberOfPoints = inputLyr.getSource().getShapeCount();

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

                        if(onlySelection){

                                if(! inputLyr.getRecordset().getSelection().get(i))

                                        continue;

                        }

                        Point2D point = inputLyr.getPoint(i);

                        Coordinate coord = new Coordinate(point.getX(), point.getY());

                        triangulator.insertPoint(coord);

                }

                LinkedList triangles = triangulator.triangles.getLinkedList();

                Iterator trianglesIterator = triangles.iterator();

                int idx = 0;

                while (trianglesIterator.hasNext()) {

                        TriangleDT t = (TriangleDT) trianglesIterator.next();

                        GeneralPathX gpx = new GeneralPathX();

                        gpx.moveTo(t.A.x, t.A.y);

                        gpx.lineTo(t.B.x, t.B.y);

                        gpx.lineTo(t.C.x, t.C.y);

                        gpx.closePath();

                        IGeometry polygon = ShapeFactory.createPolygon2D(gpx);

                        Value fid = ValueFactory.createValue(idx);

                        Value associatedVertex = ValueFactory.createValue(idx);

                        Value[] values = new Value[] { fid, associatedVertex };

                        DefaultFeature feature = new DefaultFeature(polygon, values,

                                        new UID().toString());

                        solution.add(feature);

                        idx++;

                }// while

                return solution;

        }

}