    001    //$HeadURL: https://svn.wald.intevation.org/svn/deegree/base/branches/2.4_testing/src/org/deegree/model/spatialschema/SurfacePatch.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     *
    043     * Defining the iso geometry <code>SurfacePatch</code> which is used for building surfaces. A surface patch is made of
    044     * one exterior ring and 0..n interior rings. By definition there can't be a surface patch with no exterior ring. A
    045     * polygon is a specialized surface patch.
    046     *
    047     * -----------------------------------------------------
    048     *
    049     * @author <a href="mailto:poth@lat-lon.de">Andreas Poth</a>
    050     * @version $Revision: 18195 $ $Date: 2009-06-18 17:55:39 +0200 (Do, 18. Jun 2009) $
    051     */
    052
    053    public interface SurfacePatch extends GenericSurface {
    054
    055        /**
    056         * The interpolation determines the surface interpolation mechanism used for this SurfacePatch. This mechanism uses
    057         * the control points and control parameters defined in the various subclasses to determine the position of this
    058         * SurfacePatch.
    059         *
    060         * @return the surface interpolation of this surface
    061         */
    062        SurfaceInterpolation getInterpolation();
    063
    064        /**
    065         * @return the exterior ring of a surfacePatch
    066         */
    067        Position[] getExteriorRing();
    068
    069        /**
    070         * @return the interior rings of a surfacePatch
    071         */
    072        Position[][] getInteriorRings();
    073
    074        /**
    075         *
    076         * @return the exterior ring of a surfacePatch
    077         */
    078        Ring getExterior();
    079
    080        /**
    081         *
    082         * @return the interior rings of a surfacePatch
    083         */
    084        Ring[] getInterior();
    085
    086        /**
    087         * @return the coordinate system of the surface patch
    088         */
    089        CoordinateSystem getCoordinateSystem();
    090
    091        /**
    092         * The Boolean valued operation "intersects" shall return TRUE if this surfacepatch intersects another Geometry.
    093         * Within a Complex, the Primitives do not intersect one another. In general, topologically structured data uses
    094         * shared geometric objects to capture intersection information.
    095         *
    096         * @param gmo
    097         * @return true if this surfacepatch intersects with given Geometry
    098         */
    099        boolean intersects( Geometry gmo );
    100
    101        /**
    102         * The Boolean valued operation "contains" shall return TRUE if this Geometry contains another Geometry.
    103         *
    104         * @param gmo
    105         * @return true if this surfacepatch contains given Geometry
    106         */
    107        boolean contains( Geometry gmo );
    108
    109        /**
    110         * The operation "centroid" shall return the mathematical centroid for this surfacepatch. The result is not
    111         * guaranteed to be on the object.
    112         *
    113         * @return the centroid
    114         */
    115        public Point getCentroid();
    116
    117        /**
    118         * The operation "area" shall return the area of this GenericSurface. The area of a 2 dimensional geometric object
    119         * shall be a numeric measure of its surface area Since area is an accumulation (integral) of the product of two
    120         * distances, its return value shall be in a unit of measure appropriate for measuring distances squared.
    121         */
    122        public double getArea();
    123
    124    }