source: josm/trunk/src/org/openstreetmap/josm/actions/SimplifyWayAction.java@ 10308

Last change on this file since 10308 was 9972, checked in by Don-vip, 8 years ago

sonar - remove unnecessary fully qualified names
  • Property svn:eol-style set to native
File size: 10.7 KB
Line 
1// License: GPL. For details, see LICENSE file.
2package org.openstreetmap.josm.actions;
3
4import static org.openstreetmap.josm.gui.help.HelpUtil.ht;
5import static org.openstreetmap.josm.tools.I18n.tr;
6import static org.openstreetmap.josm.tools.I18n.trn;
7
8import java.awt.event.ActionEvent;
9import java.awt.event.KeyEvent;
10import java.util.ArrayList;
11import java.util.Collection;
12import java.util.Collections;
13import java.util.HashSet;
14import java.util.LinkedList;
15import java.util.List;
16import java.util.Set;
17
18import javax.swing.JOptionPane;
19
20import org.openstreetmap.josm.Main;
21import org.openstreetmap.josm.command.ChangeCommand;
22import org.openstreetmap.josm.command.Command;
23import org.openstreetmap.josm.command.DeleteCommand;
24import org.openstreetmap.josm.command.SequenceCommand;
25import org.openstreetmap.josm.data.osm.DataSet;
26import org.openstreetmap.josm.data.osm.Node;
27import org.openstreetmap.josm.data.osm.OsmPrimitive;
28import org.openstreetmap.josm.data.osm.Way;
29import org.openstreetmap.josm.data.projection.Ellipsoid;
30import org.openstreetmap.josm.gui.HelpAwareOptionPane;
31import org.openstreetmap.josm.gui.HelpAwareOptionPane.ButtonSpec;
32import org.openstreetmap.josm.gui.Notification;
33import org.openstreetmap.josm.tools.ImageProvider;
34import org.openstreetmap.josm.tools.Shortcut;
35
36/**
37 * Delete unnecessary nodes from a way
38 * @since 2575
39 */
40public class SimplifyWayAction extends JosmAction {
41
42 /**
43 * Constructs a new {@code SimplifyWayAction}.
44 */
45 public SimplifyWayAction() {
46 super(tr("Simplify Way"), "simplify", tr("Delete unnecessary nodes from a way."),
47 Shortcut.registerShortcut("tools:simplify", tr("Tool: {0}", tr("Simplify Way")), KeyEvent.VK_Y, Shortcut.SHIFT), true);
48 putValue("help", ht("/Action/SimplifyWay"));
49 }
50
51 protected boolean confirmWayWithNodesOutsideBoundingBox(List<? extends OsmPrimitive> primitives) {
52 return DeleteCommand.checkAndConfirmOutlyingDelete(primitives, null);
53 }
54
55 protected void alertSelectAtLeastOneWay() {
56 new Notification(
57 tr("Please select at least one way to simplify."))
58 .setIcon(JOptionPane.WARNING_MESSAGE)
59 .setDuration(Notification.TIME_SHORT)
60 .setHelpTopic(ht("/Action/SimplifyWay#SelectAWayToSimplify"))
61 .show();
62 }
63
64 protected boolean confirmSimplifyManyWays(int numWays) {
65 ButtonSpec[] options = new ButtonSpec[] {
66 new ButtonSpec(
67 tr("Yes"),
68 ImageProvider.get("ok"),
69 tr("Simplify all selected ways"),
70 null
71 ),
72 new ButtonSpec(
73 tr("Cancel"),
74 ImageProvider.get("cancel"),
75 tr("Cancel operation"),
76 null
77 )
78 };
79 return 0 == HelpAwareOptionPane.showOptionDialog(
80 Main.parent,
81 tr(
82 "The selection contains {0} ways. Are you sure you want to simplify them all?",
83 numWays
84 ),
85 tr("Simplify ways?"),
86 JOptionPane.WARNING_MESSAGE,
87 null, // no special icon
88 options,
89 options[0],
90 ht("/Action/SimplifyWay#ConfirmSimplifyAll")
91 );
92 }
93
94 @Override
95 public void actionPerformed(ActionEvent e) {
96 DataSet ds = getCurrentDataSet();
97 ds.beginUpdate();
98 try {
99 List<Way> ways = OsmPrimitive.getFilteredList(ds.getSelected(), Way.class);
100 if (ways.isEmpty()) {
101 alertSelectAtLeastOneWay();
102 return;
103 } else if (!confirmWayWithNodesOutsideBoundingBox(ways)) {
104 return;
105 } else if (ways.size() > 10 && !confirmSimplifyManyWays(ways.size())) {
106 return;
107 }
108
109 Collection<Command> allCommands = new LinkedList<>();
110 for (Way way: ways) {
111 SequenceCommand simplifyCommand = simplifyWay(way);
112 if (simplifyCommand == null) {
113 continue;
114 }
115 allCommands.add(simplifyCommand);
116 }
117 if (allCommands.isEmpty()) return;
118 SequenceCommand rootCommand = new SequenceCommand(
119 trn("Simplify {0} way", "Simplify {0} ways", allCommands.size(), allCommands.size()),
120 allCommands
121 );
122 Main.main.undoRedo.add(rootCommand);
123 } finally {
124 ds.endUpdate();
125 }
126 Main.map.repaint();
127 }
128
129 /**
130 * Replies true if <code>node</code> is a required node which can't be removed
131 * in order to simplify the way.
132 *
133 * @param way the way to be simplified
134 * @param node the node to check
135 * @return true if <code>node</code> is a required node which can't be removed
136 * in order to simplify the way.
137 */
138 protected boolean isRequiredNode(Way way, Node node) {
139 boolean isRequired = Collections.frequency(way.getNodes(), node) > 1;
140 if (!isRequired) {
141 List<OsmPrimitive> parents = new LinkedList<>();
142 parents.addAll(node.getReferrers());
143 parents.remove(way);
144 isRequired = !parents.isEmpty();
145 }
146 if (!isRequired) {
147 isRequired = node.isTagged();
148 }
149 return isRequired;
150 }
151
152 /**
153 * Simplifies a way with default threshold (read from preferences).
154 *
155 * @param w the way to simplify
156 * @return The sequence of commands to run
157 * @since 6411
158 */
159 public final SequenceCommand simplifyWay(Way w) {
160 return simplifyWay(w, Main.pref.getDouble("simplify-way.max-error", 3.0));
161 }
162
163 /**
164 * Simplifies a way with a given threshold.
165 *
166 * @param w the way to simplify
167 * @param threshold the max error threshold
168 * @return The sequence of commands to run
169 * @since 6411
170 */
171 public SequenceCommand simplifyWay(Way w, double threshold) {
172 int lower = 0;
173 int i = 0;
174 List<Node> newNodes = new ArrayList<>(w.getNodesCount());
175 while (i < w.getNodesCount()) {
176 if (isRequiredNode(w, w.getNode(i))) {
177 // copy a required node to the list of new nodes. Simplify not possible
178 newNodes.add(w.getNode(i));
179 i++;
180 lower++;
181 continue;
182 }
183 i++;
184 // find the longest sequence of not required nodes ...
185 while (i < w.getNodesCount() && !isRequiredNode(w, w.getNode(i))) {
186 i++;
187 }
188 // ... and simplify them
189 buildSimplifiedNodeList(w.getNodes(), lower, Math.min(w.getNodesCount()-1, i), threshold, newNodes);
190 lower = i;
191 i++;
192 }
193
194 Set<Node> delNodes = new HashSet<>();
195 delNodes.addAll(w.getNodes());
196 delNodes.removeAll(newNodes);
197
198 if (delNodes.isEmpty()) return null;
199
200 Collection<Command> cmds = new LinkedList<>();
201 Way newWay = new Way(w);
202 newWay.setNodes(newNodes);
203 cmds.add(new ChangeCommand(w, newWay));
204 cmds.add(new DeleteCommand(delNodes));
205 w.getDataSet().clearSelection(delNodes);
206 return new SequenceCommand(
207 trn("Simplify Way (remove {0} node)", "Simplify Way (remove {0} nodes)", delNodes.size(), delNodes.size()), cmds);
208 }
209
210 /**
211 * Builds the simplified list of nodes for a way segment given by a lower index <code>from</code>
212 * and an upper index <code>to</code>
213 *
214 * @param wnew the way to simplify
215 * @param from the lower index
216 * @param to the upper index
217 * @param threshold the max error threshold
218 * @param simplifiedNodes list that will contain resulting nodes
219 */
220 protected void buildSimplifiedNodeList(List<Node> wnew, int from, int to, double threshold, List<Node> simplifiedNodes) {
221
222 Node fromN = wnew.get(from);
223 Node toN = wnew.get(to);
224
225 // Get max xte
226 int imax = -1;
227 double xtemax = 0;
228 for (int i = from + 1; i < to; i++) {
229 Node n = wnew.get(i);
230 double xte = Math.abs(Ellipsoid.WGS84.a
231 * xtd(fromN.getCoor().lat() * Math.PI / 180, fromN.getCoor().lon() * Math.PI / 180, toN.getCoor().lat() * Math.PI
232 / 180, toN.getCoor().lon() * Math.PI / 180, n.getCoor().lat() * Math.PI / 180, n.getCoor().lon() * Math.PI
233 / 180));
234 if (xte > xtemax) {
235 xtemax = xte;
236 imax = i;
237 }
238 }
239
240 if (imax != -1 && xtemax >= threshold) {
241 // Segment cannot be simplified - try shorter segments
242 buildSimplifiedNodeList(wnew, from, imax, threshold, simplifiedNodes);
243 buildSimplifiedNodeList(wnew, imax, to, threshold, simplifiedNodes);
244 } else {
245 // Simplify segment
246 if (simplifiedNodes.isEmpty() || simplifiedNodes.get(simplifiedNodes.size()-1) != fromN) {
247 simplifiedNodes.add(fromN);
248 }
249 if (fromN != toN) {
250 simplifiedNodes.add(toN);
251 }
252 }
253 }
254
255 /* From Aviaton Formulary v1.3
256 * http://williams.best.vwh.net/avform.htm
257 */
258 public static double dist(double lat1, double lon1, double lat2, double lon2) {
259 return 2 * Math.asin(Math.sqrt(Math.pow(Math.sin((lat1 - lat2) / 2), 2) + Math.cos(lat1) * Math.cos(lat2)
260 * Math.pow(Math.sin((lon1 - lon2) / 2), 2)));
261 }
262
263 public static double course(double lat1, double lon1, double lat2, double lon2) {
264 return Math.atan2(Math.sin(lon1 - lon2) * Math.cos(lat2), Math.cos(lat1) * Math.sin(lat2) - Math.sin(lat1)
265 * Math.cos(lat2) * Math.cos(lon1 - lon2))
266 % (2 * Math.PI);
267 }
268
269 public static double xtd(double lat1, double lon1, double lat2, double lon2, double lat3, double lon3) {
270 double distAD = dist(lat1, lon1, lat3, lon3);
271 double crsAD = course(lat1, lon1, lat3, lon3);
272 double crsAB = course(lat1, lon1, lat2, lon2);
273 return Math.asin(Math.sin(distAD) * Math.sin(crsAD - crsAB));
274 }
275
276 @Override
277 protected void updateEnabledState() {
278 if (getCurrentDataSet() == null) {
279 setEnabled(false);
280 } else {
281 updateEnabledState(getCurrentDataSet().getSelected());
282 }
283 }
284
285 @Override
286 protected void updateEnabledState(Collection<? extends OsmPrimitive> selection) {
287 setEnabled(selection != null && !selection.isEmpty());
288 }
289}
Note: See TracBrowser for help on using the repository browser.