    001    //$HeadURL: https://svn.wald.intevation.org/svn/deegree/base/branches/2.4_testing/src/org/deegree/model/spatialschema/CurveSegment.java $
    002    /*----------------------------------------------------------------------------
    003     This file is part of deegree, http://deegree.org/
    004     Copyright (C) 2001-2009 by:
    005       Department of Geography, University of Bonn
    006     and
    007       lat/lon GmbH
    008
    009     This library is free software; you can redistribute it and/or modify it under
    010     the terms of the GNU Lesser General Public License as published by the Free
    011     Software Foundation; either version 2.1 of the License, or (at your option)
    012     any later version.
    013     This library is distributed in the hope that it will be useful, but WITHOUT
    014     ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
    015     FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more
    016     details.
    017     You should have received a copy of the GNU Lesser General Public License
    018     along with this library; if not, write to the Free Software Foundation, Inc.,
    019     59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
    020
    021     Contact information:
    022
    023     lat/lon GmbH
    024     Aennchenstr. 19, 53177 Bonn
    025     Germany
    026     http://lat-lon.de/
    027
    028     Department of Geography, University of Bonn
    029     Prof. Dr. Klaus Greve
    030     Postfach 1147, 53001 Bonn
    031     Germany
    032     http://www.geographie.uni-bonn.de/deegree/
    033
    034     e-mail: info@deegree.org
    035    ----------------------------------------------------------------------------*/
    036
    037    package org.deegree.model.spatialschema;
    038
    039    import org.deegree.model.crs.CoordinateSystem;
    040
    041    /**
    042     * The interface defines the root of each unit building Curves
    043     *
    044     *
    045     * @author <a href="mailto:poth@lat-lon.de">Andreas Poth</a>
    046     * @author last edited by: $Author: mschneider $
    047     *
    048     * @version $Revision: 18195 $, $Date: 2009-06-18 17:55:39 +0200 (Do, 18. Jun 2009) $
    049     */
    050    public interface CurveSegment extends GenericCurve {
    051
    052        /**
    053         * @return the number of points building the curve segment
    054         */
    055        int getNumberOfPoints();
    056
    057        /**
    058         * @return all positions of the segement as array of Point
    059         */
    060        Position[] getPositions();
    061
    062        /**
    063         * @param index
    064         *            to get the curve
    065         * @return the curve position at the submitted index
    066         */
    067        Position getPositionAt( int index );
    068
    069        /**
    070         * reverses the direction of the curvesegment
    071         */
    072        void reverse();
    073
    074        /**
    075         * @return the coordinate system of the curve segment
    076         */
    077        CoordinateSystem getCoordinateSystem();
    078
    079        /**
    080         * The Boolean valued operation "intersects" shall return TRUE if this Geometry intersects another Geometry. Within
    081         * a Complex, the Primitives do not intersect one another. In general, topologically structured data uses shared
    082         * geometric objects to capture intersection information.
    083         *
    084         * @param gmo
    085         * @return true if this geometry intersects with given geometry.
    086         */
    087        boolean intersects( Geometry gmo );
    088
    089        /**
    090         * The Boolean valued operation "contains" shall return TRUE if this Geometry contains another Geometry.
    091         *
    092         * @param gmo
    093         * @return true if this geometry contains given geometry.
    094         */
    095        boolean contains( Geometry gmo );
    096
    097    }