01: /*
02: * The Unified Mapping Platform (JUMP) is an extensible, interactive GUI
03: * for visualizing and manipulating spatial features with geometry and attributes.
04: *
05: * Copyright (C) 2003 Vivid Solutions
06: *
07: * This program is free software; you can redistribute it and/or
08: * modify it under the terms of the GNU General Public License
09: * as published by the Free Software Foundation; either version 2
10: * of the License, or (at your option) any later version.
11: *
12: * This program is distributed in the hope that it will be useful,
13: * but WITHOUT ANY WARRANTY; without even the implied warranty of
14: * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15: * GNU General Public License for more details.
16: *
17: * You should have received a copy of the GNU General Public License
18: * along with this program; if not, write to the Free Software
19: * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
20: *
21: * For more information, contact:
22: *
23: * Vivid Solutions
24: * Suite #1A
25: * 2328 Government Street
26: * Victoria BC V8T 5G5
27: * Canada
28: *
29: * (250)385-6040
30: * www.vividsolutions.com
31: */
32:
33: package com.vividsolutions.jump.qa.diff;
34:
35: import com.vividsolutions.jump.feature.*;
36: import java.util.*;
37: import com.vividsolutions.jts.geom.*;
38: import com.vividsolutions.jump.geom.LineSegmentUtil;
39:
40: /**
41: * <code>DiffEdges</code> find all line segments in two
42: * FeatureCollections which occur once only.
43: */
44: public class DiffSegmentsWithTolerance {
45: private static GeometryFactory geomFactory = new GeometryFactory();
46:
47: private FeatureCollection[] inputFC = new FeatureCollection[2];
48: private double tolerance;
49: //private FeatureCollection[] fc = new FeatureCollection[2];
50: private List diffGeom[] = new ArrayList[2];
51:
52: public DiffSegmentsWithTolerance(FeatureCollection fc0,
53: FeatureCollection fc1, double tolerance) {
54: inputFC[0] = fc0;
55: inputFC[1] = fc1;
56: this .tolerance = tolerance;
57: }
58:
59: public FeatureCollection[] diff() {
60: compute(inputFC[0], inputFC[1]);
61: FeatureCollection[] diffFC = new FeatureCollection[2];
62: diffFC[0] = FeatureDatasetFactory
63: .createFromGeometry(diffGeom[0]);
64: diffFC[1] = FeatureDatasetFactory
65: .createFromGeometry(diffGeom[1]);
66: return diffFC;
67: }
68:
69: private void compute(FeatureCollection fc0, FeatureCollection fc1) {
70: diffGeom[0] = findUniqueSegmentGeometries(fc0, fc1);
71: diffGeom[1] = findUniqueSegmentGeometries(fc1, fc0);
72: }
73:
74: private List findUniqueSegmentGeometries(FeatureCollection fc0,
75: FeatureCollection fc1) {
76: List segGeomList = new ArrayList();
77: UniqueSegmentsWithToleranceFinder finder = new UniqueSegmentsWithToleranceFinder(
78: fc0, fc1);
79: List segs = finder.findUniqueSegments(tolerance);
80: for (Iterator i = segs.iterator(); i.hasNext();) {
81: LineSegment seg = (LineSegment) i.next();
82: segGeomList.add(LineSegmentUtil
83: .asGeometry(geomFactory, seg));
84: }
85: return segGeomList;
86: }
87:
88: }
|