01: //$HeadURL: https://svn.wald.intevation.org/svn/deegree/base/trunk/src/org/deegree/model/spatialschema/CurveSegment.java $
02: /*---------------- FILE HEADER ------------------------------------------
03:
04: This file is part of deegree.
05: Copyright (C) 2001-2008 by:
06: EXSE, Department of Geography, University of Bonn
07: http://www.giub.uni-bonn.de/deegree/
08: lat/lon GmbH
09: http://www.lat-lon.de
10:
11: This library is free software; you can redistribute it and/or
12: modify it under the terms of the GNU Lesser General Public
13: License as published by the Free Software Foundation; either
14: version 2.1 of the License, or (at your option) any later version.
15:
16: This library is distributed in the hope that it will be useful,
17: but WITHOUT ANY WARRANTY; without even the implied warranty of
18: MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
19: Lesser General Public License for more details.
20:
21: You should have received a copy of the GNU Lesser General Public
22: License along with this library; if not, write to the Free Software
23: Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
24:
25: Contact:
26:
27: Andreas Poth
28: lat/lon GmbH
29: Aennchenstr. 19
30: 53115 Bonn
31: Germany
32: E-Mail: poth@lat-lon.de
33:
34: Prof. Dr. Klaus Greve
35: Department of Geography
36: University of Bonn
37: Meckenheimer Allee 166
38: 53115 Bonn
39: Germany
40: E-Mail: greve@giub.uni-bonn.de
41:
42:
43: ---------------------------------------------------------------------------*/
44:
45: package org.deegree.model.spatialschema;
46:
47: import org.deegree.model.crs.CoordinateSystem;
48:
49: /**
50: * The interface defines the root of each unit building Curves
51: *
52: *
53: * @author <a href="mailto:poth@lat-lon.de">Andreas Poth</a>
54: * @author last edited by: $Author: mschneider $
55: *
56: * @version $Revision: 10547 $, $Date: 2008-03-11 01:40:28 -0700 (Tue, 11 Mar 2008) $
57: */
58: public interface CurveSegment extends GenericCurve {
59:
60: /**
61: * returns the number of points building the curve segment
62: */
63: int getNumberOfPoints();
64:
65: /**
66: * returns all positions of the segement as array of Point
67: */
68: Position[] getPositions();
69:
70: /**
71: * returns the curve position at the submitted index
72: */
73: Position getPositionAt(int index);
74:
75: /**
76: * reverses the direction of the curvesegment
77: */
78: void reverse();
79:
80: /**
81: * returns the coordinate system of the curve segment
82: */
83: CoordinateSystem getCoordinateSystem();
84:
85: /**
86: * The Boolean valued operation "intersects" shall return TRUE if this Geometry intersects
87: * another Geometry. Within a Complex, the Primitives do not intersect one another. In general,
88: * topologically structured data uses shared geometric objects to capture intersection
89: * information.
90: */
91: boolean intersects(Geometry gmo);
92:
93: /**
94: * The Boolean valued operation "contains" shall return TRUE if this Geometry contains another
95: * Geometry.
96: */
97: boolean contains(Geometry gmo);
98:
99: }
|