//$HeadURL$
/*----------------------------------------------------------------------------
This file is part of deegree, http://deegree.org/
Copyright (C) 2001-2009 by:
- Department of Geography, University of Bonn -
and
- lat/lon GmbH -
This library is free software; you can redistribute it and/or modify it under
the terms of the GNU Lesser General Public License as published by the Free
Software Foundation; either version 2.1 of the License, or (at your option)
any later version.
This library 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 Lesser General Public License for more
details.
You should have received a copy of the GNU Lesser General Public License
along with this library; if not, write to the Free Software Foundation, Inc.,
59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
Contact information:
lat/lon GmbH
Aennchenstr. 19, 53177 Bonn
Germany
http://lat-lon.de/
Department of Geography, University of Bonn
Prof. Dr. Klaus Greve
Postfach 1147, 53001 Bonn
Germany
http://www.geographie.uni-bonn.de/deegree/
e-mail: info@deegree.org
----------------------------------------------------------------------------*/
package org.deegree.igeo.commands.digitize;
import org.deegree.kernel.AbstractCommand;
import org.deegree.model.spatialschema.JTSAdapter;
import org.deegree.model.spatialschema.Position;
import com.vividsolutions.jts.algorithm.CGAlgorithms;
/**
* TODO add class documentation here
*
* @author <a href="mailto:name@deegree.org">Andreas Poth</a>
* @author last edited by: $Author$
*
* @version $Revision$, $Date$
*/
abstract class AbstractPolygonHoleCommand extends AbstractCommand {
/**
*
* @param ring
* @return true if an array of passed {@link Position} forms a clockwise orientated ring
*/
protected static boolean isClockwise( Position[] ring ) {
return !CGAlgorithms.isCCW( JTSAdapter.export( ring ).getCoordinates() );
}
/**
* inverts the order of the positions of a ring
*
* @param inner
*/
protected static void invertPositionOrder( Position[] inner ) {
for ( int i = 0; i < inner.length / 2; i++ ) {
Position tmp = inner[i];
inner[i] = inner[inner.length - 1 - i];
inner[inner.length - 1 - i] = tmp;
}
}
/*
* (non-Javadoc)
*
* @see org.deegree.kernel.Command#isUndoSupported()
*/
public boolean isUndoSupported() {
return true;
}
}