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