| gvSIG desktop 1

import java.util.ArrayList;

import com.vividsolutions.jts.algorithm.CGAlgorithms;

import com.vividsolutions.jts.geom.Coordinate;

import com.vividsolutions.jts.geom.CoordinateList;

import com.vividsolutions.jts.geom.CoordinateSequences;

import com.vividsolutions.jts.geom.impl.CoordinateArraySequence;

	/**

     * Convertimos el path a puntos y luego le damos la vuelta.

     */

    public void flip()

	{

		PathIterator theIterator = getPathIterator(null, Converter.FLATNESS); //polyLine.getPathIterator(null, flatness);

		double[] theData = new double[6];

        Coordinate first = null;

        CoordinateList coordList = new CoordinateList();

        Coordinate c1;

        GeneralPathX newGp = new GeneralPathX();

        ArrayList listOfParts = new ArrayList();

		while (!theIterator.isDone()) {

			//while not done

			int type = theIterator.currentSegment(theData);

        	switch (type)

        	{

        	case SEG_MOVETO:

        		coordList = new CoordinateList();

        		listOfParts.add(coordList);

        		c1= new Coordinate(theData[0], theData[1]);

        		coordList.add(c1, true);

        		break;

        	case SEG_LINETO:

        		c1= new Coordinate(theData[0], theData[1]);

        		coordList.add(c1, true);

        		break;

        	case SEG_CLOSE:

        		coordList.add(coordList.getCoordinate(0));

        		break;

        	}

        	theIterator.next();

		}

		for (int i=listOfParts.size()-1; i>=0; i--)

		{

			coordList = (CoordinateList) listOfParts.get(i);

			Coordinate[] coords = coordList.toCoordinateArray();

			CoordinateArraySequence seq = new CoordinateArraySequence(coords);

			CoordinateSequences.reverse(seq);

			coords = seq.toCoordinateArray();

			newGp.moveTo(coords[0].x, coords[0].y);

			for (int j=1; j < coords.length; j++)

			{

				newGp.lineTo(coords[j].x, coords[j].y);

			}

		}

		reset();

		append(newGp, false);

	}

    /**

     * Check if the first part is CCW.

     * @return

     */

    public boolean isCCW()

    {

        int i;

		PathIterator theIterator = getPathIterator(null, Converter.FLATNESS); //polyLine.getPathIterator(null, flatness);

		double[] theData = new double[6];

        Coordinate first = null;

        CoordinateList coordList = new CoordinateList();

        Coordinate c1;

        boolean bFirst = true;

		while (!theIterator.isDone()) {

			//while not done

			int type = theIterator.currentSegment(theData);

        	switch (type)

        	{

        	case SEG_MOVETO:

        		c1= new Coordinate(theData[0], theData[1]);

        		if (bFirst == false) // Ya tenemos la primera parte.

        			break;

        		if (bFirst)

        		{

        			bFirst=false;

        			first = c1;

        		}

        		coordList.add(c1, true);

        		break;

        	case SEG_LINETO:

        		c1= new Coordinate(theData[0], theData[1]);

        		coordList.add(c1, true);

        		break;

        	}

        	theIterator.next();

		}

		coordList.add(first, true);

        return CGAlgorithms.isCCW(coordList.toCoordinateArray());

    }