001: //$HeadURL: https://svn.wald.intevation.org/svn/deegree/base/trunk/src/org/deegree/model/spatialschema/PolygonImpl.java $
002: /*---------------- FILE HEADER ------------------------------------------
003:
004: This file is part of deegree.
005: Copyright (C) 2001-2008 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: package org.deegree.model.spatialschema;
045:
046: import java.io.Serializable;
047:
048: import org.deegree.framework.log.ILogger;
049: import org.deegree.framework.log.LoggerFactory;
050: import org.deegree.model.crs.CoordinateSystem;
051:
052: /**
053: *
054: *
055: *
056: * @author <a href="mailto:poth@lat-lon.de">Andreas Poth</a>
057: * @author last edited by: $Author: mschneider $
058: *
059: * @version $Revision: 10547 $, $Date: 2008-03-11 01:40:28 -0700 (Tue, 11 Mar 2008) $
060: */
061: class PolygonImpl extends SurfacePatchImpl implements Polygon,
062: Serializable {
063: /** Use serialVersionUID for interoperability. */
064: private final static long serialVersionUID = -1293845886457211088L;
065:
066: private static final ILogger LOG = LoggerFactory
067: .getLogger(PolygonImpl.class);
068:
069: private SurfaceBoundary boundary = null;
070:
071: /**
072: *
073: * @param exteriorRing
074: * @param interiorRings
075: * @param crs
076: */
077: PolygonImpl(Ring exteriorRing, Ring[] interiorRings,
078: CoordinateSystem crs) {
079: super (exteriorRing, interiorRings, crs);
080: }
081:
082: /**
083: * Creates a new PolygonImpl object.
084: *
085: * @param interpolation
086: * @param exteriorRing
087: * @param interiorRings
088: * @param crs
089: *
090: * @throws GeometryException
091: */
092: PolygonImpl(SurfaceInterpolation interpolation,
093: Position[] exteriorRing, Position[][] interiorRings,
094: CoordinateSystem crs) throws GeometryException {
095: super (interpolation, exteriorRing, interiorRings, crs);
096: // TODO
097: // implementation based on segments
098:
099: Ring outer = new RingImpl(exteriorRing, crs);
100: Ring[] inner = null;
101:
102: if (interiorRings != null) {
103: inner = new Ring[interiorRings.length];
104:
105: for (int i = 0; i < inner.length; i++) {
106: inner[i] = new RingImpl(interiorRings[i], crs);
107: }
108: }
109:
110: boundary = new SurfaceBoundaryImpl(outer, inner);
111: }
112:
113: /**
114: * The operation "boundary" shall return the boundary of this SurfacePatch represented as a
115: * collection of Curves organized as a SurfaceBoundary, consisting of Curve instances along the
116: * boundary of the aggregate Surface, and interior to the Surface where SurfacePatches are
117: * adjacent.
118: *
119: */
120: public SurfaceBoundary getBoundary() {
121: return boundary;
122: }
123:
124: /**
125: * checks if this curve is completly equal to the submitted geometry
126: *
127: * @param other
128: * object to compare to
129: */
130: public boolean equals(Object other) {
131: if (!super .equals(other) || !(other instanceof PolygonImpl)) {
132: return false;
133: }
134:
135: return true;
136: }
137:
138: /**
139: *
140: *
141: * @return
142: */
143: public String toString() {
144: String ret = "SurfacePatch: ";
145: ret = "interpolation = " + interpolation + "\n";
146: ret += "exteriorRing = \n";
147: ret += (exteriorRing + "\n");
148: ret += ("interiorRings = " + interiorRings + "\n");
149: ret += ("envelope = " + getEnvelope() + "\n");
150: return ret;
151: }
152:
153: /**
154: * returns a shallow copy of the geometry
155: */
156: public Object clone() {
157: Polygon p = null;
158:
159: try {
160: p = new PolygonImpl(new SurfaceInterpolationImpl(
161: getInterpolation().getValue()), getExteriorRing(),
162: getInteriorRings(), this .crs);
163: } catch (Exception e) {
164: LOG.logError(e.getMessage(), e);
165: }
166:
167: return p;
168: }
169:
170: /**
171: * The Boolean valued operation "intersects" shall return TRUE if this Geometry intersects
172: * another Geometry. Within a Complex, the Primitives do not intersect one another. In general,
173: * topologically structured data uses shared geometric objects to capture intersection
174: * information.
175: */
176: public boolean intersects(Geometry gmo) {
177: boolean inter = false;
178:
179: try {
180: if (gmo instanceof Point) {
181: double tolerance = ((Point) gmo).getTolerance();
182: inter = LinearIntersects.intersects(((Point) gmo)
183: .getPosition(), this , tolerance);
184: } else if (gmo instanceof Curve) {
185: inter = LinearIntersects.intersects((Curve) gmo,
186: new SurfaceImpl(this ));
187: } else if (gmo instanceof Surface) {
188: inter = LinearIntersects.intersects((Surface) gmo,
189: new SurfaceImpl(this ));
190: } else if (gmo instanceof Aggregate) {
191: inter = intersectsMultiObject((Aggregate) gmo);
192: }
193: } catch (Exception e) {
194: LOG.logError(e.getMessage(), e);
195: }
196:
197: return inter;
198: }
199:
200: /**
201: * the operations returns true if the submitted multi primitive intersects with the curve
202: * segment
203: */
204: private boolean intersectsMultiObject(Aggregate mprim)
205: throws Exception {
206: boolean inter = false;
207:
208: int cnt = mprim.getSize();
209:
210: for (int i = 0; i < cnt; i++) {
211: if (intersects(mprim.getObjectAt(i))) {
212: inter = true;
213: break;
214: }
215: }
216:
217: return inter;
218: }
219:
220: /**
221: * The Boolean valued operation "contains" shall return TRUE if this Geometry contains another
222: * Geometry.
223: * <p>
224: * </p>
225: */
226: public boolean contains(Geometry gmo) {
227: boolean contain = false;
228:
229: try {
230: if (gmo instanceof Point) {
231: contain = LinearContains.contains(this , ((Point) gmo)
232: .getPosition(), gmo.getTolerance());
233: } else if (gmo instanceof Curve) {
234: contain = LinearContains.contains(this , ((Curve) gmo)
235: .getAsLineString(), gmo.getTolerance());
236: } else if (gmo instanceof Surface) {
237: contain = LinearContains.contains(
238: new SurfaceImpl(this ), (Surface) gmo);
239: } else if (gmo instanceof Aggregate) {
240: contain = containsMultiObject((Aggregate) gmo);
241: }
242: } catch (Exception e) {
243: LOG.logError(e.getMessage(), e);
244: }
245:
246: return contain;
247: }
248:
249: /**
250: *
251: *
252: * @param gmo
253: *
254: * @return
255: */
256: private boolean containsMultiObject(Aggregate gmo) {
257: try {
258: for (int i = 0; i < gmo.getSize(); i++) {
259: if (!contains(gmo.getObjectAt(i))) {
260: return false;
261: }
262: }
263: } catch (Exception e) {
264: LOG.logError(e.getMessage(), e);
265: }
266:
267: return true;
268: }
269: }
|