source: osm/applications/editors/josm/plugins/utilsplugin/src/UtilsPlugin/SimplifyWayAction.java@ 18926

Last change on this file since 18926 was 18926, checked in by guggis, 16 years ago

'Updated to new referrer support in OsmPrimitive'

  • Property svn:eol-style set to native
File size: 8.5 KB
Line 
1package UtilsPlugin;
2
3import static org.openstreetmap.josm.tools.I18n.tr;
4import static org.openstreetmap.josm.tools.I18n.trn;
5
6import java.awt.event.ActionEvent;
7import java.awt.event.KeyEvent;
8import java.util.ArrayList;
9import java.util.Collection;
10import java.util.Collections;
11import java.util.HashSet;
12import java.util.LinkedList;
13import java.util.List;
14
15import javax.swing.JOptionPane;
16
17import org.openstreetmap.josm.Main;
18import org.openstreetmap.josm.actions.JosmAction;
19import org.openstreetmap.josm.command.ChangeCommand;
20import org.openstreetmap.josm.command.Command;
21import org.openstreetmap.josm.command.DeleteCommand;
22import org.openstreetmap.josm.command.SequenceCommand;
23import org.openstreetmap.josm.data.Bounds;
24import org.openstreetmap.josm.data.osm.DataSource;
25import org.openstreetmap.josm.data.osm.Node;
26import org.openstreetmap.josm.data.osm.OsmPrimitive;
27import org.openstreetmap.josm.data.osm.Way;
28import org.openstreetmap.josm.gui.layer.OsmDataLayer;
29import org.openstreetmap.josm.tools.Shortcut;
30
31public class SimplifyWayAction extends JosmAction {
32 public SimplifyWayAction() {
33 super(tr("Simplify Way"), "simplify", tr("Delete unnecessary nodes from a way."), Shortcut.registerShortcut("tools:simplify", tr("Tool: {0}", tr("Simplify Way")),
34 KeyEvent.VK_Y, Shortcut.GROUP_EDIT, Shortcut.SHIFT_DEFAULT), true);
35 }
36
37 public void actionPerformed(ActionEvent e) {
38 Collection<OsmPrimitive> selection = Main.main.getCurrentDataSet().getSelected();
39
40 int ways = 0;
41 LinkedList<Bounds> bounds = new LinkedList<Bounds>();
42 OsmDataLayer dataLayer = Main.map.mapView.getEditLayer();
43 for (DataSource ds : dataLayer.data.dataSources) {
44 if (ds.bounds != null)
45 bounds.add(ds.bounds);
46 }
47 for (OsmPrimitive prim : selection) {
48 if (prim instanceof Way) {
49 if (bounds.size() > 0) {
50 Way way = (Way) prim;
51 // We check if each node of each way is at least in one download
52 // bounding box. Otherwise nodes may get deleted that are necessary by
53 // unloaded ways (see Ticket #1594)
54 for (Node node : way.getNodes()) {
55 boolean isInsideOneBoundingBox = false;
56 for (Bounds b : bounds) {
57 if (b.contains(node.getCoor())) {
58 isInsideOneBoundingBox = true;
59 break;
60 }
61 }
62 if (!isInsideOneBoundingBox) {
63 int option = JOptionPane.showConfirmDialog(Main.parent,
64 tr("The selected way(s) have nodes outside of the downloaded data region.\n"
65 + "This can lead to nodes being deleted accidentally.\n"
66 + "Are you really sure to continue?"),
67 tr("Please abort if you are not sure"), JOptionPane.YES_NO_CANCEL_OPTION,
68 JOptionPane.WARNING_MESSAGE);
69
70 if (option != JOptionPane.YES_OPTION)
71 return;
72 break;
73 }
74 }
75 }
76
77 ways++;
78 }
79 }
80
81 if (ways == 0) {
82 JOptionPane.showMessageDialog(Main.parent, tr("Please select at least one way to simplify."));
83 return;
84 } else if (ways > 10) {
85 //TRANSLATION: Although for English the use of trn is needless it is important for other languages
86 int option = JOptionPane.showConfirmDialog(Main.parent, trn(
87 "The selection contains {0} way. Are you sure you want to simplify it?",
88 "The selection contains {0} ways. Are you sure you want to simplify them all?",
89 ways,ways),
90 tr("Are you sure?"), JOptionPane.YES_NO_OPTION);
91 if (option != JOptionPane.YES_OPTION)
92 return;
93 }
94
95 for (OsmPrimitive prim : selection) {
96 if (prim instanceof Way) {
97 simplifyWay((Way) prim);
98 }
99 }
100 }
101
102 public void simplifyWay(Way w) {
103 double threshold = Double.parseDouble(Main.pref.get("simplify-way.max-error", "3"));
104
105 Way wnew = new Way(w);
106
107 int toI = wnew.getNodesCount() - 1;
108 List<OsmPrimitive> parents = new ArrayList<OsmPrimitive>();
109 for (int i = wnew.getNodesCount() - 1; i >= 0; i--) {
110 //CollectBackReferencesVisitor backRefsV = new CollectBackReferencesVisitor(Main.main.getCurrentDataSet(), false);
111 //backRefsV.visit(wnew.getNode(i));
112 parents.addAll(w.getNode(i).getReferrers());
113 boolean used = false;
114 if (parents.size() == 1) {
115 used = Collections.frequency(w.getNodes(), wnew.getNode(i)) > 1;
116 } else {
117 parents.remove(w);
118 used = !parents.isEmpty();
119 }
120 if (!used)
121 used = wnew.getNode(i).isTagged();
122
123 if (used) {
124 simplifyWayRange(wnew, i, toI, threshold);
125 toI = i;
126 }
127 }
128 simplifyWayRange(wnew, 0, toI, threshold);
129
130 HashSet<Node> delNodes = new HashSet<Node>();
131 delNodes.addAll(w.getNodes());
132 delNodes.removeAll(wnew.getNodes());
133
134 if (wnew.getNodesCount() != w.getNodesCount()) {
135 Collection<Command> cmds = new LinkedList<Command>();
136 cmds.add(new ChangeCommand(w, wnew));
137 cmds.add(new DeleteCommand(delNodes));
138 Main.main.undoRedo.add(new SequenceCommand(trn("Simplify Way (remove {0} node)", "Simplify Way (remove {0} nodes)", delNodes.size(), delNodes.size()), cmds));
139 Main.map.repaint();
140 }
141 }
142
143 public void simplifyWayRange(Way wnew, int from, int to, double thr) {
144 if (to - from >= 2) {
145 ArrayList<Node> ns = new ArrayList<Node>();
146 simplifyWayRange(wnew, from, to, ns, thr);
147 List<Node> nodes = wnew.getNodes();
148 for (int j = to - 1; j > from; j--) {
149 nodes.remove(j);
150 }
151 nodes.addAll(from + 1, ns);
152 wnew.setNodes(nodes);
153 }
154 }
155
156 /*
157 * Takes an interval [from,to] and adds nodes from (from,to) to ns.
158 * (from and to are indices of wnew.nodes.)
159 */
160 public void simplifyWayRange(Way wnew, int from, int to, ArrayList<Node> ns, double thr) {
161 Node fromN = wnew.getNode(from), toN = wnew.getNode(to);
162
163 int imax = -1;
164 double xtemax = 0;
165 for (int i = from + 1; i < to; i++) {
166 Node n = wnew.getNode(i);
167 double xte = Math.abs(EARTH_RAD
168 * xtd(fromN.getCoor().lat() * Math.PI / 180, fromN.getCoor().lon() * Math.PI / 180, toN.getCoor().lat() * Math.PI
169 / 180, toN.getCoor().lon() * Math.PI / 180, n.getCoor().lat() * Math.PI / 180, n.getCoor().lon() * Math.PI
170 / 180));
171 if (xte > xtemax) {
172 xtemax = xte;
173 imax = i;
174 }
175 }
176
177 if (imax != -1 && xtemax >= thr) {
178 simplifyWayRange(wnew, from, imax, ns, thr);
179 ns.add(wnew.getNode(imax));
180 simplifyWayRange(wnew, imax, to, ns, thr);
181 }
182 }
183
184 public static double EARTH_RAD = 6378137.0;
185
186 /* From Aviaton Formulary v1.3
187 * http://williams.best.vwh.net/avform.htm
188 */
189 public static double dist(double lat1, double lon1, double lat2, double lon2) {
190 return 2 * Math.asin(Math.sqrt(Math.pow(Math.sin((lat1 - lat2) / 2), 2) + Math.cos(lat1) * Math.cos(lat2)
191 * Math.pow(Math.sin((lon1 - lon2) / 2), 2)));
192 }
193
194 public static double course(double lat1, double lon1, double lat2, double lon2) {
195 return Math.atan2(Math.sin(lon1 - lon2) * Math.cos(lat2), Math.cos(lat1) * Math.sin(lat2) - Math.sin(lat1)
196 * Math.cos(lat2) * Math.cos(lon1 - lon2))
197 % (2 * Math.PI);
198 }
199
200 public static double xtd(double lat1, double lon1, double lat2, double lon2, double lat3, double lon3) {
201 double dist_AD = dist(lat1, lon1, lat3, lon3);
202 double crs_AD = course(lat1, lon1, lat3, lon3);
203 double crs_AB = course(lat1, lon1, lat2, lon2);
204 return Math.asin(Math.sin(dist_AD) * Math.sin(crs_AD - crs_AB));
205 }
206}
Note: See TracBrowser for help on using the repository browser.